In this article, we’ll try to establish the relation between Round Robin and Preemptive Priority Scheduling Algorithm. Let’s discuss the algorithms one by one first and then establish how Round Robin is a special kind of Preemptive Priority Scheduling Algorithm.
As higher priority processes keep on adding, prior processes get preempted and get the CPU later on.
The Round Robin scheduling algorithm is a preemptive scheduling algorithm. It uses a concept of time slice or time quantum. The process at the beginning of the ready queue gets the chance to be executed first but only for the span of one-time quantum.
As new and more processes get added to the ready queue, the ongoing process gets preempted and gets added to the end of the ready queue. The next process gets the chance, again for the span of one-time quantum. This algorithm is designed for time-sharing systems.
In Round Robin Scheduling Algorithm, when a process is already in the CPU being executed it has a limited time quantum which it gets to execute within but if it cannot complete itself then it gets preempted. So as the time quantum progresses the chances of the process being preempted increases.
Its priority decreases. Whereas, the process which is waiting in the ready queue is getting its chances increased in terms of getting the CPU next. So, its priority increases. So, we can say that Round Robin is a special kind of Preemptive Priority Scheduling Algorithm where a process in the ready queue gets its priority increased and a process in the CPU gets its priority decreased.
On the other hand, the preemptive priority scheduling algorithm does not behave like the RR algorithm under any condition.
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.
- Difference between Preemptive Priority based and Non-preemptive Priority based CPU scheduling algorithms
- Relation in FCFS and Preemptive Priority Scheduling Algorithm
- Difference between Priority Scheduling and Round Robin (RR) CPU scheduling
- Relation in FCFS and Round Robin Scheduling Algorithm
- Difference between Preemptive and Non-preemptive CPU scheduling algorithms
- Priority to Round-robin scheduling with dynamic time quantum
- Preemptive and Non-Preemptive Scheduling
- Difference between First Come First Served (FCFS) and Round Robin (RR) Scheduling Algorithm
- Program for Preemptive Priority CPU Scheduling
- Difference between Shortest Job First (SJF) and Round-Robin (RR) scheduling algorithms
- Difference between Longest Job First (LJF) and Round Robin (RR) scheduling algorithms
- Difference between Multi Level Queue (MLQ) Scheduling and Round Robin (RR) algorithms
- Program for Round Robin scheduling | Set 1
- Selfish Round Robin CPU Scheduling
- Round Robin Scheduling with different arrival times
- Calculate server loads using Round Robin Scheduling
- Find the order of execution of given N processes in Round Robin Scheduling
- Difference between Priority scheduling and Shortest Job First (SJF) CPU scheduling
- Difference between Multi Level Queue Scheduling (MLQ) and Priority Scheduling
- Shortest Job First (or SJF) CPU Scheduling Non-preemptive algorithm using Segment Tree
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.