Question: The following processes are being scheduled using a preemptive, roundrobin scheduling algorithm. Each process is assigned a numerical priority, with a higher number indicating a
The following processes are being scheduled using a preemptive, roundrobin
scheduling algorithm. Each process is assigned a numerical
priority, with a higher number indicating a higher relative priority.
In addition to the processes listed below, the system also has an idle
task (which consumes no CPU resources and is identified as I ). This
task has priority 0 and is scheduled whenever the system has no other
available processes to run. The length of a time quantum is 5 units.
If a process is preempted by a higher-priority process, the preempted
process is placed at the end of the queue.
a. Show the scheduling order of the processes using a Gantt chart.
Enter the times for the above chart starting with 0
b. What is the turnaround time for each process?
| TAT | |
| p1 | |
| p2 | |
| p3 | |
| p4 | |
| p5 | |
| p6 |
c. What is the waiting time for each process?
| WT | |
| p1 | |
| p2 | |
| p3 | |
| p4 | |
| p5 | |
| p6 |
d. What is the CPU utilization rate?
Round of to two decimal places.
| Thread | Priority | Burst | Arrival |
| P1 | 20 | 30 | 0 |
| P2 | 30 | 20 | 20 |
| P3 | 20 | 10 | 50 |
| P4 | 35 | 25 | 65 |
| P5 | 5 | 5 | 95 |
| P6 | 15 | 10 | 105 |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
