Last updated on:May 26th, 2018,

Round Robin Process Scheduling algorithm in operating systems

Round Robin Scheduling

Round Robin Scheduling is the preemptive scheduling algorithm.

We assign a fixed time to all processes for execution, this time is called time quantum.

All processes can execute only until their time quantum and then leave the CPU and give a chance to other processes to complete their execution according to time quantum.

Context switching mechanism store the states of preempted processes.

Time quantum = 2

ProcessBurst TimeArrival


Round robin scheduling in os operating systems
Figure: Round robin scheduling of operating systems (os).

C++ Program for Round Robin Scheduling



Leave a Reply

Your email address will not be published.