Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process P1 P2 P3 P4 P5

[answerhappygod]

Consider The Following Set Of Processes With The Length Of The Cpu Burst Given In Milliseconds Process P1 P2 P3 P4 P5 1 (77.36 KiB) Viewed 102 times

Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process P1 P2 P3 P4 P5 Burst Time 10 1 2 1 5 Priority 3 1 3 4 2 The processes are assumed to have arrived in the order P1.P2, P3, P4 and P5 at time 0. a. Draw four Gantt charts that illustrate the exclusion of these processes using the following scheduling algorithms: FCFS, SJF, non-preemptive priority (a smaller priority number implies a higher priority), and RR (quantum=1). b. What is the turnaround time of each process for each of the scheduling algorithms in part a? Compute the Average tumaround time for each scheduling algorithm c. What is the waiting time of each process for each of the scheduling algorithms in part a? Compute the Average waiting time for each scheduling algorithm d. Which of the schedules in part a results in the minimal average waiting time (over all processes)?