Question

1. Consider the following set of processes, with the length of CPU burst and arrival time given in milliseconds.                                                             

Process            Burst time       Priority            Arrival Time            

P₁                         10                    3                              0

P₂                          1                     1                              2

P₃                          2                     4                              4

P₄                          5                     2                              8

a)

Draw the Gantt chart that illustrates the execution of these processes using the preemptive priority scheduling algorithm (a smaller priority number implies a higher priority).

b)

What is the average waiting time for these processes using the preemptive priority scheduling algorithm?

Answer 1

Your question is answered below:

Please give positive rating.