Process Manag
Process Manag
0
• Waiting 24 P = 27
time for P1 = 0; P2 = 24; 30
3 27
• Average waiting time: (0 + 24 + 27)/3 = 17
FCFS Scheduling (Cont.)
Suppose that the processes arrive in the order
P2 , P3 , P1
• The Gantt chart for the schedule is:
P2 P3 P1
0 3 6 30
0 3 7 8 12 16
0 2 4 5 7 11 16
P1 P2 P3 P4 P1 P3 P4 P1 P3 P3
• Multilevel-feedback-queue scheduler
defined by the following parameters:
– number of queues
– scheduling algorithms for each queue
– method used to determine when to upgrade
a process
Example of Multilevel Feedback
Queue
• Three queues:
– Q0 – RR with time quantum 8 milliseconds
– Q1 – RR time quantum 16 milliseconds
– Q2 – FCFS
• Scheduling