What is Round Robin Scheduling for processes in an Operating System and why this is a preferred choice?

Answer 1

This is pretty a fair process scheduling algorithm. In round robin scheduling algorithm, each process gets a fixed time and for the end user seems the machine is allocated to him only. For example : When so many students write their program in Linux system during examination.

If a system wants to treat all processes with the same level/priority then it should prefer RR scheduling.

Answer 2

What is Round Robin Scheduling
As the term is generally used, time slices are assigned to each process in equal portions and in circular order, handling all processes without priority
1. Each process is provided a fix time to execute called quantum.
2. Once a process is executed for given time period. Process is preempted and other process executes for given time period.
3. Context switching is used to save states of preempted processes.

The main advantage of round robin algorithm over others is that it is starvation free. Every process will be executed by CPU for fixed interval of time (which is set as time slice) . So in this way no process left waiting for its turn to be executed by the CPU.