= Round-robin scheduling
= RR
{c}
{synonym}
Serve the front of a <FIFO queue> of runnable tasks for at most one <scheduling quantum>. If the task finishes or must wait for <input-output>, it leaves the <CPU> earlier; if it remains runnable after consuming its allowance, append it to the rear of the <ready queue>. In the example under <process scheduling>, the <ready queue> at time 2 is B, C, A: B arrived at time 1, C joins at the boundary, then A is requeued. That one convention determines the subsequent order.
Back to article page
