0
5.3kviews
Round Robin CPU Scheduling Problem
| written 3.6 years ago by | modified 3.6 years ago by |
Assume you have the following jobs to execute with one processor, with the jobs arriving in the the order listed here:
| Process | Burst Time | Arrival Time |
|---|---|---|
| 0 | 80 | 0 |
| 1 | 20 | 10 |
| 2 | 10 | 10 |
| 3 | 20 | 80 |
| 4 | 50 | 85 |
(i) Suppose a system uses RR scheduling with a quantum of 15. Create a Gantt chart illustrating the execution of these processes?
(ii) What is the turnaround time for process p3?
(iii) What is the average wait time for the processes
ADD COMMENT
EDIT
1 Answer

and 4 others joined a min ago.
and 5 others joined a min ago.