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

If we set the time slice to be 4 ms, the processes will run in the order below:

The schedule of the 3 processes under RR.

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