The Following processes are being scheduled using a Premptive RR scheduling Alogrithm. Each Process is Assigned a numeric Proirity, with higher number indicating higher priority. In addition it also has ideal task which consumes no CPU Resources and is identified by Pidle. This task has Priority 0 and is scheduled whenever the system has no other process to run. The length of time Quantum = 10 units.If a process is prempted by a higher priority process,the prempted process is placed at the end of queue.
Thread |
Priority |
Burst |
Arrival |
P1 |
40 |
20 |
0 |
P2 |
30 |
25 |
25 |
P3 |
30 |
25 |
30 |
P4 |
35 |
15 |
60 |
P5 |
5 |
10 |
100 |
P6 |
10 |
10 |
105 |
A. Turn Around Time of Each Process ?
B. Waiting time of Each Process ?
C. CPU Utilization Rate ?