Scheduling Algorithms

Example of a cooperative SJF: Suppose that 4 processes, P1, P2, P3, and P4 arrive at the ready queue:

Process Burst Time (in milliseconds)
P1
6
P2
8
P3
7
P4
3

The processes will run in the following order:

The schedule of the 4 processes under SJF.

The schedule of the 4 processes under SJF. Taken from Bell, John T. "CPU Scheduling." University of Illinois, Chicago.