11 November, 2011
This week, I will put most of the things that we have learnt together in CS2106 and traced through an example of what happen when you execute a command. We will also go into details of some steps that we haven’t have time to cover before.
Having a hardcopy of slides during lecture would be helpful. Be prepare to take notes during lecture.
Download Slides: PDF
4 November, 2011
We focus on file systems in this week’s lecture. Will talk a little bit about disk performances as well.
Having a hardcopy of slides during lecture would be helpful. Be prepare to take notes during lecture.
Download Slides: PDF
Reading:
Related Wikipedia entries are listed below. These are for students who are keen to go beyond what is covered in CS2106. Read the articles with a critical mind since Wikipedia is editable by anyone.
28 October, 2011
This lecture cleans up the remaining topics on memory management and introduces system calls related to file management
Having a hardcopy of slides during lecture would be helpful. Be prepare to take notes during lecture.
Download Slides: PDF
Reading:
Related Wikipedia entries are listed below. These are for students who are keen to go beyond what is covered in CS2106. Read the articles with a critical mind since Wikipedia is editable by anyone.
21 October, 2011
This lecture is the second of a three-part series looking into memory management issues in OS.
Having a hardcopy of slides during lecture would be helpful. Be prepare to take notes during lecture.
Download Slides: PDF
Reading:
Related Wikipedia entries are listed below. These are for students who are keen to go beyond what is covered in CS2106. Read the articles with a critical mind since Wikipedia is editable by anyone.
14 October, 2011
This lecture is the first of a two-part series looking into memory management issues in OS.
Having a hardcopy of slides during lecture would be helpful. Be prepare to take notes during lecture.
Download Slides: PDF
Reading:
Related Wikipedia entries are listed below. These are for students who are keen to go beyond what is covered in CS2106. Read the articles with a critical mind since Wikipedia is editable by anyone.
30 September, 2011 This week we will look at deadlock in more details, as well as other nuisances caused by buggy synchronization code, including livelock, starvation, and priority inversion. Having a hardcopy of slides during lecture would be helpful. Be prepare to take notes during lecture.
Download Slides: PDF
Reading:
Related Wikipedia entries are listed below. These are for students who are keen to go beyond what is covered in CS2106. Read the articles with a critical mind since Wikipedia is editable by anyone.
The examples I shown during demo in class were missing from the earlier post. Here they are:
16 September, 2011
We have mentioned CPU scheduler several time in the past lectures. This week, we finally get to meet the scheduler! We will discuss different CPU scheduling algorithms, starting with simple algorithms and slowly build up towards complex scheduling algorithms used in Linux today. Having a hardcopy of slides during lecture would be helpful. Be prepare to take notes during lecture. Download Slides: PDF Reading:
Related Wikipedia entries are listed below. These are for students who are keen to go beyond what is covered in CS2106. Read the articles with a critical mind since Wikipedia is editable by anyone.
The book “Operating Systems: Four Easy Pieces” by Remzi and Andrea Arpaci-Dusseau has a nicely written chapter on MLFQ.
For those who are interesting in the glory details of Linux scheduler (in version 2.6), you can take a look at the relevant pages from “Understanding the Linux Kernel” by Daniel Pierre Bovet and Marco Cesati. Here is the link to the pages from Google Book.
9 September, 2010
While previous lecture focuses on mutual exclusion, this second lecture on inter-process communication (IPC) focuses on synchronization among processes. You will learn about using semaphore to solve the producer-consumer problem and dining philosopher problem. We will end the lecture on threads programming in C.
Having a hardcopy of slides during lecture would be helpful. Be prepare to take notes during lecture. Demo code will be shown during lecture and posted after the class along with screencast.
Download Slides: PDF
Reading:
Related Wikipedia entries are listed below. These are for students who are keen to go beyond what is covered in CS2106. Read the articles with a critical mind since Wikipedia is editable by anyone.
Here is a nice tutorial on phtread programming by Blaise Barney of Lowrence Livermore National Laboratory.
2 September, 2011
This is the first of a two-lecture series on inter-process communication (IPC). You will learn about share memory and message passing as two generic methods for IPC, and learn about signals and pipes, two communication abstractions on UNIX. We will then discuss the complexities that arise from sharing of resources between two processes (or two threads), and cover the concepts of race conditions, mutual exclusion, critical regions, and consider various methods to ensure mutual exclusion (including test-and-set, peterson’s algorithm, and disabling interrupts).
Having a hardcopy of slides during lecture would be helpful. Be prepare to take notes during lecture.
Download Slides: PDF
Reading:
Related Wikipedia entries are listed below. These are for students who are keen to go beyond what is covered in CS2106. Read the articles with a critical mind since Wikipedia is editable by anyone.