Round robin is the programming algorithm used by the CPU during the execution of the process. Round Robin is designed specifically for timeshare systems. It is similar to the first come first serve programming algorithm but preemption is the added functionality to switch between processes.
A small unit of time also known as a slice of time or quantum is established / defined. The ready queue functions as a queue. All processes in this algorithm are kept in the circular queue also known as ready queue. Each new process is added to the queue of the ready / circular queue.
By using this algorithm, the CPU ensures that the time intervals (any natural number) are assigned to each process in equal parts and in circular order, treating the entire process without any priority.
He is also known as a cyclical executive.
The main advantage of the round robin algorithm over the first come first serve algorithm is that it is free from hunger. Each process will be executed by the CPU for a fixed interval of time (which is set as time interval). So in this way there was no process waiting for its turn to be executed by the CPU.
The round robin algorithm is simple and easy to implement. The name round robin comes from the principle known as round robin in which each person takes the equal part of something in turn.