A MLF algorithm uses 5 priority levels. At level 5, a process executes for Q =...

 

Transcribed Image Text:

A MLF algorithm uses 5 priority levels. At level 5, a process executes for Q = 1 ms. At each of the lower levels the quantum is doubled (2Q, 4Q, 8Q, 16Q). The following processes are to be scheduled: Process Arrival Total CPU time (b) p1 p2 Determine the ATT for each process. 0 1 1 p3 1 14 After termination, process p1 blocks for 4 ms and then reenters the queue again at level 5. Similarly, process p2 blocks for 5 ms and then reenters the queue again at level 5 3 (a) Draw a timing diagram for the first 33 ms. On each of the 3 lines (one per process) show when the process is running and at which priority level. A MLF algorithm uses 5 priority levels. At level 5, a process executes for Q = 1 ms. At each of the lower levels the quantum is doubled (2Q, 4Q, 8Q, 16Q). The following processes are to be scheduled: Process Arrival Total CPU time (b) p1 p2 Determine the ATT for each process. 0 1 1 p3 1 14 After termination, process p1 blocks for 4 ms and then reenters the queue again at level 5. Similarly, process p2 blocks for 5 ms and then reenters the queue again at level 5 3 (a) Draw a timing diagram for the first 33 ms. On each of the 3 lines (one per process) show when the process is running and at which priority level.

Answer rating: 100% (QA)

a Timing Diagram for the First 33 ms Time ms Priority Level Process P1 Priority Level Process P2 Pri... View the full answer