1. Consider the following set of processes, with the length of the CPU-burst time in milliseconds: Process Burst Time Ar
Posted: Mon Jun 06, 2022 5:56 pm
1. Consider the following set of processes, with the length of the CPU-burst time in milliseconds: Process Burst Time Arrival Time Priority P 18 0 3 Q 2 1 R 2 2 S 4 T 16 9 5 Draw Gantt charts to illustrate the execution of these processes using SJF and pre-emptive Priority, and RR (quantum =3) scheduling. What is the turnaround time of each process for each of the scheduling algorithm? What is the waiting time of each process for each of the scheduling algorithms? Which algorithm gives optimum waiting time and turnaround time? i. ii. 111. iv. 12 13 14 8