Round Robin is a CPU scheduling algorithm in which each process is cyclically assigned through a fixed time slot. It is the preemptive version of the First come, First Serve CPU Scheduling algorithm.
Round Robin CPU Algorithm usually focuses on the technique of Time Sharing technique.
Quantum is defined as the period for which a process is allowed to run in a pre-emptive method.
Each Job or process in the ready queue gets assigned the CPU for that time quantum. In case the execution of the process gets completed during that time, then the ongoing process will end, or else the process will go back to the waiting table and wait for its turn to complete the execution in the next turn.
Which of the Following Algorithm Defines Time Quantum?
Here are a few characteristics of the Round Robin CPU Scheduling Algorithm-
It is one of the most commonly used techniques for CPU scheduling as a core.
It is simple to use, easy to implement, and starvation-free, as all processes get a fair share of CPU.
It is proactive as processes are assigned CPU only for a fixed time slot.