Consider the following set of processes, with the length of the cpu burst given in milliseconds:
process burst time priority arrival time
p1 9 0 0
p2 4 1 1
p3 2 3 2
p4 3 4 3
p5 1 2 4
1. draw four gantt charts that illustrate the execution of these processes using the following scheduling algorithms:
rr (round robin) with quantum=1.
if the scheduling criteria results in a tie, existing processes take precedence over newly arrived processes. for round robin a pre-empted process is placed on the ready list before a process that arrived at the same time.
2. what is the turnaround time of each process for this of the scheduling algorithms in part 1?
3. what is the waiting time of each process for this the scheduling algorithms in part 1?
4. which of the algorithms results in the minimum average waiting time (over all processes)?