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:
- Section 2.4 Scheduling (up to and include Shortest Process Next only)
- Section 10.3.4 Scheduling in Linux (Note: the 2nd edition of the textbook describes an older version of Linux scheduler)
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.
- CPU scheduling
- Shortest Remaining Time First
- Priority Scheduling
- Round Robin Scheduling
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.