Consider the following set of processes with the length of t

Consider the following set of processes, with the length of the CPU burst size given in milliseconds. The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. A lower priority value corresponds to a higher priority.

Process Burst Time      Priority

P1                    4                      3

P2                    2                      1

P3                    3                      2

P4                    2                      3

P5                    5                      1

Calculate the average waiting time of each process for each of the scheduling algorithms in the table below and place the answers in the table below.

Process	Shortest Job First (SJF)	First come first serve (FCFS)	Round Robin (quantum = 2)	Nonpreemptive priority
P1
P2
P3
P4
P5

Solution

Process Shortest Job First (SJF) First come first serve (FCFS) Round Robin (quantum = 2) Nonpreemptive priority P1 1.5 -3 10 1 P2 2 -0.5 1 1 P3 2.2 0.5 7 1 P4 3.6 1.5 6 7/4 P5 4 2.2 4 1