Owen L.

asked • 11/27/20# Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:

Q. Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:

Process Burst Time

P1 66

P2 33

P3 57

P4 20

P5 25

The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.

a) Draw three Gantt charts illustrating the execution of these processes using FCFS, SJF, and RR (quantum = 20) scheduling.

b) What is the waiting time of each process for each of the scheduling algorithms in part a?

c) Which of the schedules in part a results in the minimal average waiting time (over all processes)?

## 1 Expert Answer

Sid M. answered • 12/18/20

Studied Computer Science and Engineering at University of Washington

b) What is the waiting time of each process for each of the scheduling algorithms in part a?

(See the tables, above.)

c) Which of the schedules in part a results in the minimal average waiting time (over all processes)?

FCFS = Avg(0, 66, 99, 156, 176) = 99.4ms

SJF = Avg(0, 20, 45, 78, 135) = 55.6ms

RR = Avg(0, 20, 40, 60, 80) = 40.0ms

## Still looking for help? Get the right answer, fast.

Get a free answer to a quick problem.

Most questions answered within 4 hours.

#### OR

Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.

Owen L.

just short answer required ASAP!11/27/20