Round Robin (RR)

Description

A round robin is an arrangement of choosing all elements in a group equally in some rational order, usually from the top to the bottom of a list and then starting again at the top of the list and so on. A simple way to think of round robin is that it is about "taking turns." Used as an adjective, round robin becomes "round-robin."

In computer operation, one method of having different program process take turns using the resources of the computer is to limit each process to a certain short time period, then suspending that process to give another process a turn (or "time-slice"). This is often described as round-robin process scheduling.

Example & Simulation

Example #1

Time Quota : 3

Process Arrival Time Burst Time
P1 0 3
P2 1 4
P3 2 2
P4 4 1
P5 6 3
P6 8 1
Run Simulation

Example #2

Time Quota : 2

Process Arrival Time Burst Time
P1 0 4
P2 1 5
P3 2 6
P4 4 1
P5 6 3
P6 7 2
Run Simulation

Try It Yourself!

Time Quota :

PROCESS
Process Arrival Time Burst Time
P1
Add Row
Run Simulation

0

Process Remaining Waiting Turnaround Status
Print Result

Process Waiting Turnaround