|
|
Computer Science 322
Operating Systems
Mount Holyoke College
Spring 2010
|
|
Lecture 07: CPU Scheduling
Date: Monday, February 22, 2010
Quote of the day:
|
- Frank: | "What does that mean? PSPN?" |
|
- Prof. Williams: | "First, it means you have at least 20/30 vision. It also means |
|
| Preemptive Shortest Process Next." |
|
| - CS135, 1/9/91 |
|
|
Agenda
- Announcements
- Reminder: no class Wednesday
- Lab 2 due
- Lab 3 out
- Lecture assignment recap
- CPU Scheduling
- Long-term, short-term, medium-term scheduling
- CPU burst times, process categorization
- CPU scheduling goals
- Relationship between response time and throughput
- Scheduling algorithms:
- FCFS
- SJF/SRTF
- Priority
- RR
- Multilevel feedback queues
- Fair-share and Lottery scheduling
- Comparisons of scheduling algorithms
Lecture Assignment 07
Due at the start of class, Monday, March 1.
You need not submit answers to these
questions, but you will have a chance to ask questions about them at
the start of class.
- SG&G Practice Exercise 5.1, p. 218
- SG&G Practice Exercise 5.3, p. 219
- SG&G Practice Exercise 5.6, p. 220
- SG&G Exercise 5.13, p. 221
Please submit answers to these questions
either as a hard copy (typeset or handwritten are OK) or by email to
jteresco AT mtholyoke.edu by the start of class. We will discuss these questions at
the start of class, so no late submissions are accepted.
This lecture assignment is longer than your typical lecture assignment
for this course and will be worth more. Expect to spend more time.
- SG&G Exercise 5.12, p. 220
- SG&G Exercise 5.14, p. 221
- SG&G Exercise 5.21, p. 222
- Read and briefly summarize in a few paragraphs the key points
about the Linux 2.6 scheduler as described in Krohn,
2003.
- Read and briefly summarize in a few paragraphs the key points
about the FreeBSD ULE scheduler as described in McKusick and
Neville-Neil, ACM Queue,
2004.