Consider the set of processes with Arrival time, CPU Burst time and Priority (5 is the highest priority) shown below.
PROCESS
ARRIVAL TIME
BURST TIME
PRIORITY
P0
5ms
9ms
4
P1
0ms
6ms
2
P2
15ms
10ms
1
P3
9ms
3ms
3
P4
12ms
5ms
5
Calculate the average waiting time of all the processes using preemptive priority scheduling algorithm.
Comments
Leave a comment