TKTL TKTL Koti Yhteystiedot Laitos Ihmiset Opiskelu Hakeminen Tutkimus Uutta

---

Kerola KJ-II kotisivu Aikataulu k04 Kuvaus Kantasivu TKTL Kokeet Luennot (pdf) Luennot (html) Laskuharjoitukset Kertaustehtävät Ryhmätyö Ryhmätyön UKK Ryhmät/aiheet K04 Kirjanpito K04 Schedule Spr-04 Description Exams Practice Problems Homeworks Team Project Bookkeeping Spr-04

Homework                                          [ Sivu suomen kielellä] (näyttö layout) (tulostus layout) (kämmen layout)

Operating Systems II,  Spring 2004, HW 4

This will be covered in practise session during the week 17 (20-22.4.2004)

1. Scheduling algorithm s
   1. Problem 9.1 from text book [Stal01, p. 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.10 from text book
    
3. Real time scheduling
   1. Problem 10.2 from text book [Stal01, s. 469]
   2. What is the measure of goodness for these algorithms? Would some other measure be better?
   
    
4. Problem 10.3 from text book
    
5. 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])
   1. priorities?
   2. time slice?
   3. scheduling?
   4. SMP support?
   5. real time support?
   
   

 

---

Teemu Kerola 02.04.2004 18:45