This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: C B 8 13 22 26 (c) shortest time to completion first A B D C 8 12 17 26 Average Response Time Process Round Robin Priority Scheduling SJF A 1 8 8 B 1 25 11 C 2 20 24 D 3 10 14 Question 4.2:Two periodic processes are ready to run at time 0: P1(2,1) and P2(5,2.5) (2 and 5 are intervals as well as deadlines, 1 and 2.5 are processing time). Draw a timeline for each process to show when they are running and when they are waiting, assuming that there is no context switching overhead. (a) The system uses EDF (earliest deadline first) scheduling. (b) The system uses RM (rate monotonic) scheduling. Answer 4.2:(a) The system uses EDF (earliest deadline first) scheduling. P1 P2 P1 P1 P1 P2 P1 0 1 3.5 4.5 5.5 6.5 9 10 (b) The system uses RM (rate monotonic) scheduling. P1 P2 P1 P2 P1 P2 P1 0 1 2 3 4 5 5.5 6 7...
View
Full
Document
 Spring '10
 lie

Click to edit the document details