Scheduling Algorithms
Example: Suppose that 5 processes, P1, P2, P3, P4, and P5 arrive at the ready queue:
| Process | Burst Time (in milliseconds) | Priority (1 = will run first) |
|---|---|---|
P1 |
10 |
3 |
P2 |
1 |
1 |
P3 |
2 |
4 |
P4 |
1 |
5 |
P5 |
5 |
2 |
The processes will run in the following order:
The schedule of the 5 processes under Priority Scheduling. Taken from Bell, John T. "CPU Scheduling." University of Illinois, Chicago.
These notes by Miriam Briskman are licensed under CC BY-NC 4.0 and based on sources.