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)?

Owen L.

just short answer required ASAP!
Report

11/27/20

1 Expert Answer

By:

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

Ask a question for free

Get a free answer to a quick problem.
Most questions answered within 4 hours.

OR

Find an Online Tutor Now

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