Relation between Preemptive Priority and Round Robin Scheduling Algorithm Last Updated : 01 Oct, 2020 Comments Improve Suggest changes Like Article Like Report 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. Prerequisite - CPU Scheduling | Difference between Priority and Round Robin (RR) Scheduling. Preemptive Priority Scheduling Algorithm : Preemptive Priority Scheduling Algorithm at time = 0 As higher priority processes keep on adding, prior processes get preempted and get the CPU later on. Round Robin Scheduling Algorithm : 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. Round Robin Scheduling Algorithm with time slice = 4 at time = 0 Round Robin Scheduling Algorithm is a special kind of Preemptive Priority Scheduling Algorithm : 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. Note - On the other hand, the preemptive priority scheduling algorithm does not behave like the RR algorithm under any condition. Comment More infoAdvertise with us Next Article Relation between Preemptive Priority and Round Robin Scheduling Algorithm srishtiganguly1999 Follow Improve Article Tags : Operating Systems GATE CS Operating Systems-CPU Scheduling Similar Reads Relation in FCFS and Preemptive Priority Scheduling Algorithm In this article, we will see how FCFS is a special kind of Priority Preemptive Scheduling Algorithm. Also, we will cover the relation with each other. Let us discuss one by one. 1. First Come First Serve (FCFS) Scheduling Algorithm : FCFS is the simplest of CPU Scheduling Algorithm which executes th 4 min read Relation in FCFS and Round Robin Scheduling Algorithm In this article, we'll see how FCFS is special kind of Round Robin Algorithm and Round Robin is special kind of FCFS Algorithm. Also, we will cover the relation with each other. Let's discuss one by one. First Come First Serve (FCFS) Scheduling Algorithm : FCFS is simplest of CPU Scheduling Algorith 3 min read Difference between Multi Level Queue (MLQ) Scheduling and Round Robin (RR) algorithms Queue Scheduling refers to the process of managing and organizing tasks (or processes) that need to be executed by a system. In an operating system, tasks are often placed in queues waiting for CPU to execute them. Queue scheduling helps the system decide which task to run next, and in what order, e 4 min read Difference between Shortest Job First (SJF) and Round-Robin (RR) scheduling algorithms The performance of the multiprocessor system and time-sharing system rely upon CPU scheduling algorithm. Some of the well known efficient CPU scheduling algorithms are Round Robin scheduling (RR), Shortest job first(SJF), Preemptive version of SJF(SRTF), First Come First Serve (FCFS) etc. As of now, 4 min read Difference between First Come First Served (FCFS) and Round Robin (RR) Scheduling Algorithm First Come First Served Scheduling Algorithm: First Come First Served (FCFS) is the simplest and non-preemptive scheduling algorithm. In First Come First Served (FCFS), the process is allocated to the CPU in the order of their arrival. A queue data structure is used to implement the FCFS scheduling 2 min read Difference Between Preemptive and Non-Preemptive CPU Scheduling Algorithms Preemptive scheduling permits a high-priority task to interrupt a running process, When a process transitions from the running to the ready or from the waiting to the ready states, preemptive scheduling is used. Whereas in non-preemptive scheduling, any new process must wait until the running proces 6 min read Difference between Priority Scheduling and Round Robin (RR) CPU scheduling 1. Priority Scheduling Algorithm : Priority scheduling algorithm executes the processes depending upon their priority. Each process is allocated a priority and the process with the highest priority is executed first. Priorities can be defined internally as well as externally. Internal priorities are 3 min read Difference between Preemptive Priority based and Non-preemptive Priority based CPU scheduling algorithms Prerequisite - CPU Scheduling Priority Scheduling : In priority scheduling, each process has a priority which is an integer value assigned to it. The smallest integer is considered as the highest priority and the largest integer is considered as the lowest priority. The process with the highest prio 4 min read Difference between LJF and LRJF CPU scheduling algorithms 1. Longest Job First (LJF) : It CPU Scheduling algorithm where the process with the largest burst line is executed first. Once the process enters the ready queue, the process exits only after the completion of execution, therefore it is a non-preemptive process. In case, the burst times of the proce 2 min read Difference between EDF and LST CPU scheduling algorithms 1. Earliest Deadline First (EDF) : In Earliest Deadline First scheduling algorithm, at every scheduling point the task having the shortest deadline is scheduled for the execution. It is an optimal dynamic priority-driven scheduling algorithm used in real-time systems. It uses priorities of the tasks 4 min read Like