Operating Systems208010 marksNumerical: CPU scheduling algorithmsTurnaround time calculation
CPU Scheduling Analysis Find Average waiting time and turn-around time for the following example using FIFO, SRTF and Round Robin scheduling algorithm. Assume quantum as 4 ms. | Process id | Arrival time | Burst time (ms) | |:---:|:---:|:---:| | P1 | 0 | 8 | | P2 | 1 | 5 | | P3 | 1 | 10 | | P4 | 2 |
CPU Scheduling Analysis
Find Average waiting time and turn-around time for the following example using FIFO, SRTF and Round Robin scheduling algorithm. Assume quantum as 4 ms.
| Process id | Arrival time | Burst time (ms) |
|---|---|---|
| P1 | 0 | 8 |
| P2 | 1 | 5 |
| P3 | 1 | 10 |
| P4 | 2 | 13 |
| P5 | 2 | 17 |
[10]
Process Arrival Time Burst Time ---------------------------------- P1 0 8 P2 1 5 P3 1 10 P4 2 13 P5 2 17 Quantum $q = 4$ ms. Formulas: TAT = CT - AT, WT = TAT - BT. --- Order by arrival: P1 → P2 → P3 → P4 → P5. Gantt: P1[0-8] P2[8-13] P3[13-23] P4[23-36] P5[36-53] P AT BT CT TAT WT --------------...