Round Robin (RR) Scheduling in OS

Round Robin (RR) scheduling is one of the most popular CPU scheduling algorithms in OS. In Round Robin scheduling, each process gets a fixed amount of CPU time, which is called a time quantum or time slice.

Once the time quantum is completed, the running process is preempted; it is moved to the end of the ready queue, and the next process from the ready queue is executed.

In this lecture, we will explain Round Robin (RR) scheduling with an example, its advantages, and disadvantages.