Ask
Login
3
231kviews
Consider the following set of processes, with the length of CPU burst given in milliseconds.
written 8.0 years ago by gravatar for snehalb snehalb • 900 modified 4.1 years ago by gravatar for prashantsaini prashantsaini • 0

The processes are assumed to have arrived in the order $P_1, P_2, P_3, P_4, P_5$ all at time 0. Calculate the average turnaround time and maximum waiting time for per- emptive scheduling algorithm.

enter image description here
operating systems
ADD COMMENT EDIT
1 Answer
23
21kviews
written 8.0 years ago by gravatar for snehalb snehalb • 900

a) FCFS scheduling:

Here the processes are scheduled as per the order in which they arrive.

Gantt chart:

enter image description here

Waiting time for P1=0

Waiting time for P2=10

Waiting time for P3=11

Waiting time for P4=13

Waiting time for P5=14

Average waiting time$=\frac{Sum of waiting time for individual process}{No. of processes}$ $=\frac{0+10+11+13+14}{5} …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.