Design your example and give computation results of several cpu schedulers

Process   Arrival Time   Burst Time

P1            0                         7

P2            1                         6

P3            2                        11

P4            3                        3

 

First-Come, First-Served: Average Waiting Time = (0 + 6 + 17 + 20)/4 = 10.75

Shortest-Next-CPU-Burst: Average Waiting Time = (9 + 3 + 16 + 0)/4 = 7

Shortest-Remaining-Time-First: Average Waiting Time = ((7-3) + (10-1) + (16-2) + (3-3))/4 = 6.75

Round-Robin(Time Quantum=3):Average Waiting Time = ((0+12+21) + (3+15) + (6+18+22) + 9)/4 = 26.5