Operating Systems05 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. | Processes | CPU Burst | Priority | |-----------|-----------|----------| | A | 8 | 3 | | B | 13 | 1 (Lowest) | | C | 19 | 2 | | D | 3 | 4 (Highest) | The processes are assumed t
CPU Scheduling Analysis
Consider the following set of processes, with the length of CPU burst time given in milliseconds.
| Processes | CPU Burst | Priority |
|---|---|---|
| A | 8 | 3 |
| B | 13 | 1 (Lowest) |
| C | 19 | 2 |
| D | 3 | 4 (Highest) |
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 = 5) and Priority Algorithm?
[5]
Process CPU Burst (ms) Priority ----------------------------------- A 8 3 B 13 1 (Lowest) C 19 2 D 3 4 (Highest) Arrival: all at time 0, order A, B, C, D. Total burst = $8+13+19+3 = 43$ ms. --- Ready queue starts A, B, C, D. Track remaining bursts. Slot Proc Start End Remaining after ------------...