Assume that the ready queue has just received four processes: P1, P2, P3, P4, in that...

 

 

Transcribed Image Text:

Assume that the ready queue has just received four processes: P1, P2, P3, P4, in that order. All at time 0. The CPU execution times for these processes are as follows: Process Execution Time P1 12 P2 19 P3 7 P4 18 Draw the Gantt chart and calculate the metric listed in parentheses for each of the following scheduling algorithms: 1. First Come, First Served (Total Wait Time) 2. Shortest Job First (Total Wait Time) 3. Round Robin, with a quantum of 6ms (Total Wait and Response Times) Assume that the ready queue has just received four processes: P1, P2, P3, P4, in that order. All at time 0. The CPU execution times for these processes are as follows: Process Execution Time P1 12 P2 19 P3 7 P4 18 Draw the Gantt chart and calculate the metric listed in parentheses for each of the following scheduling algorithms: 1. First Come, First Served (Total Wait Time) 2. Shortest Job First (Total Wait Time) 3. Round Robin, with a quantum of 6ms (Total Wait and Response Times)