Consider the following set of processes, with the length of the CPU burst given in milliseconds....

 

Transcribed Image Text:

Consider the following set of processes, with the length of the CPU burst given in milliseconds. Process P1 P2 P3 P4 P5 Burst Time Priority 12 2 1 1 4 4 2 1 3 2 m) Draw Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: Priority Scheduling Algorithm and Round-Robin scheduling algorithm (quantum =2). n) What is the waiting time of each process for each of the scheduling algorithms? o) Which of the algorithms produce results in the minimum average waiting time (over all processes)? Consider the following set of processes, with the length of the CPU burst given in milliseconds. Process P1 P2 P3 P4 P5 Burst Time Priority 12 2 1 1 4 4 2 1 3 2 m) Draw Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: Priority Scheduling Algorithm and Round-Robin scheduling algorithm (quantum =2). n) What is the waiting time of each process for each of the scheduling algorithms? o) Which of the algorithms produce results in the minimum average waiting time (over all processes)?