Scheduling Algorithms
Example: Suppose that 3 processes, P1, P2, and P3, arrive at the ready queue:
| Process | Burst Time (in milliseconds) |
|---|---|
P1 |
24 |
P2 |
3 |
P3 |
3 |
Burst Time is the time that a process will run on the CPU until it starts waiting for I/O.
If the Scheduler uses FCFS, the processes will run in the order depicted in the following Gantt diagram:
The schedule of the 3 processes under FCFS. 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.