Question: 10. Suppose that the following processes arrive for execution at the times indicated. will run for the amount of time listed. (27 pts) Each process
10. Suppose that the following processes arrive for execution at the times indicated. will run for the amount of time listed. (27 pts) Each process Process Arrival Time Burst Time Pi P2 Ps P. 0 6 (a) What is the average waiting time and turnaround time respectively with the preemptive Shortest-Remaining-Time-First scheduling? (10 pts) (b) What is the average waiting time and turnaround time respectively with the Round-Robin scheduling (size of 4 quantum)? (10 pts) (c) Based on the results above, discuss pros and cons for each algorithm. (7 pts)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
