Round Robin Scheduler

Tags

comp-arch

Is a scheduling algorithm that schedules processes in order of their arrival in the queue, and then forcibly removes processes from the running state and back into the ready queue after a small time step.

The maximum amount of time that a process can execute before being stopped is called the Time Quanta. Note: As the time quanta approaches infinity, the round robin scheduler will be equivalent to a FCFS scheduler.