1.速率单调调度:
速率单调调度是一种优先级算法,根据循环时间为进程分配优先级,任务持续时间最短的进程获得优先级。它是抢占式的:最高优先级的进程将抢占其他进程。进程的优先级与其循环时间成反比。
2.截止日期单调调度:
最后期限单调调度是一种优先级算法,其中根据进程各自的最后期限将优先级分配给进程。截止日期是必须完成任务的时间限制。具有最短期限的进程被分配最高优先级。它也是先发制人的。进程的优先级与截止日期成反比。
速率单调调度和截止日期单调调度的区别:
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. |