1. Rate Monotonic Scheduling :
Rate monotonic scheduling is a priority algorithm in which the priorities are assigned to the processes according to the cycle time, a process with the least task duration is given the priority. It is preemptive: the highest priority process will preempt the other processes. The priority of a process is inversely proportional to its cycle time.
2. Deadline Monotonic Scheduling :
Deadline monotonic scheduling is a priority algorithm in which the priorities are assigned to the processes based on their respective deadlines. A deadline is a time limit in which a task has to be completed. The process with the shortest deadline is assigned the highest priority. It is also preemptive. The priority of a process is inversely proportional to the deadline.
Difference between Rate Monotonic Scheduling and Deadline monotonic Scheduling :
|Rate Monotonic Scheduling||Deadline Monotonic Scheduling|
|In Rate monotonic Scheduling, priorities are assigned to tasks according to the shortest cycle time||In Deadline monotonic Scheduling, priorities are assigned to tasks according to the shortest deadline.|
|Implementation of Rate monotonic scheduler is simple and can be executed using FIFO (First-in First-out) scheduling.||Implementation of Deadline monotonic scheduler is complicated and is time-taking process.|
|The choice of priority is decided based on the computation time or active frequency.||The choice of priority is decided based on which task is ready to be executed first.|
|Priority is inversely proportional to the cycle time.||Priority is inversely proportional to the deadline (time limit).|
|RMA is not optimal with periodic tasks when deadline and period differ.||DMA is more proficient than RMA when deadline and period differ.|
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.
- Deadline Monotonic CPU Scheduling
- Rate-monotonic scheduling
- Difference between Bit Rate and Baud Rate
- Earliest Deadline First (EDF) CPU scheduling algorithm
- Difference between Relative and Absolute Deadline of Real-time Task
- Difference between Delay and Deadline Constraint in Real-time System
- Difference between Priority Scheduling and Round Robin (RR) CPU scheduling
- Difference between Priority scheduling and Shortest Job First (SJF) CPU scheduling
- Difference between Multi Level Queue Scheduling (MLQ) and Priority Scheduling
- Deadline scheduler in Operating System
- Difference between Bandwidth and Data Rate
- Multilevel Feedback Queue Scheduling (MLFQ) CPU Scheduling
- Difference between Preemptive Priority based and Non-preemptive Priority based CPU scheduling algorithms
- Difference between Turn Around Time (TAT) and Waiting Time (WT) in CPU Scheduling
- Difference between Preemptive and Non-preemptive CPU scheduling algorithms
- Difference between Seek Time and Rotational Latency in Disk Scheduling
- Difference between Seek Time and Disk Access Time in Disk Scheduling
- Difference between SCAN and LOOK Disk scheduling algorithms
- Difference between SJF and LJF CPU scheduling algorithms
- Difference between Seek Time and Transfer Time in Disk Scheduling
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.
Improved By : pp_pankaj