Tietojenkäsittelytieteen laitos

Homework                                          [ Sivu suomen kielellä]

Operating Systems II,  Spring 2006, HW 4

This will be covered in practise session during the week 15 (10-14.4.2006)

1. Scheduling algorithms
   1. Problem 9.1 from text book [Stal05, s. 423] (Probl. 9.1 [Stal01, s. 426]),
      but only for FIFO, RR q=1, RR q=4 ja SRT algorithms
   2. What does proportion Tr / Ts mean? What does it measure? Would some other measure be better?
      
      
2. Problem 9.11 from text book [Stal05] (Teht. 9.10 [Stal01])
    
3. Real time scheduling
   1. Problem 10.2 from text book [Stal05, p. 477] (Teht. 10.2 [Stal01, p. 470])
   2. What is the measure of goodness for these algorithms? Would some other measure be better?
   
    
4. Problem 10.3 from text book [Stal05] (Probl. 10.3 [Stal01])
    
5. What are the biggest differences for W2K and Linux 2.6 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]. Current text book version [Stal05] contains also introduction to Linux 2.6 scheduler)
   1. priorities?
   2. time slice?
   3. scheduling?
   4. SMP support?
   5. real time suppor

 

---

Teemu Kerola 29.03.2006 15:39