![suomeksi](http://www.cs.Helsinki.FI/gif/f-fi.gif)
Operating Systems II, Spring 2004, HW 4
This will be covered in practise session during the week 17 (20-22.4.2004)
- Scheduling algorithm
s
- Problem 9.1 from text book [Stal01, p. 426], but only for FIFO, RR q=1, RR q=4 ja SRT algorithms
- What does proportion Tr / Ts mean? What does it measure? Would some
other measure be better?
- Problem 9.10 from text book
- Real time scheduling
- Problem 10.2 from text book [Stal01, s. 469]
- What is the measure of goodness for these algorithms? Would some other measure be better?
- Problem 10.3 from text book
- What are the biggest differences for
W2K and Linux scheduling as compared to the basic techniques given in Chapters
9 and 10? How do they differ from each other?
(If you were not at the lecture, Ch 10.3, 11.4 [Tane01] and Ch 20 [DDC04] present Linux and W2K scheduling more throroughly than Stallings [Stal01])- priorities?
- time slice?
- scheduling?
- SMP support?
- real time support?
Teemu Kerola 02.04.2004 18:45