Scheduling_Algorithms_Solutions
Scheduling_Algorithms_Solutions
Given Data:
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
| Time | P1 | P2 | P3 | P4 | P5 |
|------|------|------|------|------|------|
|0 | 10 | 11 | 13 | 14 | 19 |
| Time | P2 | P4 | P3 | P5 | P1 |
|------|------|------|------|------|------|
|0 |1 |2 |4 |9 | 19 |
| Time | P2 | P5 | P1 | P3 | P4 |
|------|------|------|------|------|------|
|0 |1 |6 | 16 | 18 | 19 |
|------|------|------|------|------|------|------|------|------|------|------|
|0 |1 |2 |3 |4 |5 |6 |7 |8 |9 | 10 |
Average Waiting Time (AWT):- FCFS: 9.6 ms- SJF: 5.8 ms- Priority: 10.8 ms- RR: 6 ms
Conclusion: The Round-Robin (RR) algorithm has the minimum average waiting time of 6 ms.