Operating Systems20785 marksNumerical: CPU scheduling algorithmsRound Robin scheduling
CPU Scheduling Analysis Consider the following set of processes, with the length of CPU burst time given in milliseconds. The processes are assumed to have arrived in the order A, B, C and D all at time 0. What is the turnaround time and waiting time for the scheduling algorithms, RR (quantum = 3) a
CPU Scheduling Analysis
Consider the following set of processes, with the length of CPU burst time given in milliseconds. The processes are assumed to have arrived in the order A, B, C and D all at time 0. What is the turnaround time and waiting time for the scheduling algorithms, RR (quantum = 3) and Priority Algorithm.
| Process | CPU Burst | Priority |
|---|---|---|
| A | 8 | 3 |
| B | 9 | 1 (Lowest) |
| C | 10 | 2 |
| D | 6 | 4 (Highest) |
[5]
Process CPU Burst Priority ------------------------------ A 8 3 B 9 1 (Lowest) C 10 2 D 6 4 (Highest) All arrive at time 0, in order A, B, C, D. Formulas: $TAT = CT - AT$, $WT = TAT - Burst$. --- Ready queue starts: A, B, C, D. A process that still has remaining burst rejoins the tail of the queu...