Round Robin

• Distributes the processing time equitably among all ready processes

• The algorithm establishes a particular time slice (or time quantum), which is the amount of time each process receives before being preempted and returned to the ready state to allow another process its turn