lec11-protectionx4.pdfVIP

Page 1 CS162 Operating Systems and Systems Programming Lecture 11 Thread Scheduling (con’t) Protection: Address Spaces February 23, 2010 Ion Stoica /~cs162 Lec 11.2 2/23/10 CS162 ?UCB Spring 2010 Review: Last Time ?? Scheduling: selecting a waiting process from the ready queue and allocating the CPU to it ?? FCFS Scheduling: –? Run threads to completion in order of submission –? Pros: Simple (+) –? Cons: Short jobs get stuck behind long ones (-) ?? Round-Robin Scheduling: –? Give each thread a small amount of CPU time when it executes; cycle between all ready threads –? Pros: Better for short jobs (+) –? Cons: Poor when jobs are same length (-) Lec 11.3 2/23/10 CS162 ?UCB Spring 2010 Goals for Today ?? Finish discussion of Scheduling ?? Kernel vs User Mode ?? What is an Address Space? ?? How is it Implemented? Note: Some slides and/or pictures in the following are adapted from slides ?2005 Silberschatz, Galvin, and Gagne Lec 11.4 2/23/10 CS162 ?UCB Spring 2010 Example to illustrate benefits of SRTF ?? Three jobs: –? A,B: both CPU bound, run for week C: I/O bound, loop 1ms CPU, 9ms disk I/O –? If only one at a time, C uses 90% of the disk, A or B could use 100% of the CPU ?? With FIFO: –? Once A or B get in, keep CPU for two weeks ?? What about RR or SRTF? –? Easier to see with a timeline C C’s I/O C’s I/O C’s I/O A or B Page 2 Lec 11.5 2/23/10 CS162 ?UCB Spring 2010 SRTF Example continued: C’s I/O CABAB… C C’s I/O RR 1ms time slice C’s I/O C’s I/O C A B C RR 100ms time slice C’s I/O A C C’s I/O A A SRTF Disk Utilization: ~90% but lots of wakeups! Disk Utilization: 90% Disk Utilization: 9/201 ~ 4.5% Lec 11.6 2/23/10 CS162 ?UCB Spring 2010 Review: SRTF Further discussion ?? Starvation –? SRTF can lead to starvation if many small jobs! –? Large jobs never get to run ?? Somehow need to predict future –? How can we do this? –? Some systems ask the user ?? When you submit