Rate Monotonic Schedulability Conditions Using Relative Period Ratios

2006 ◽  
Author(s):  
Wan-Chen Lu ◽  
Hsin-Wen Wei ◽  
Kwei-Jay Lin
Keyword(s):  
Rate Monotonic ◽  
Relative Period

Generalized rate monotonic schedulability bounds using relative period ratios

2008 ◽  
Vol 107 (5) ◽  
pp. 142-148 ◽  
Author(s):  
Hsin-Wen Wei ◽  
Kwei-Jay Lin ◽  
Wan-Chen Lu ◽  
Wei-Kuan Shih
Keyword(s):  
Rate Monotonic ◽  
Relative Period

A Review of Sufficient Schedulability Analysis for Fixed Priority Scheduling Systems

2015 ◽  
Vol 741 ◽  
pp. 856-859
Author(s):  
Yan Feng Zhai ◽  
Feng Xiang Zhang
Keyword(s):  
Schedulability Analysis ◽  
Priority Assignment ◽  
Priority Scheduling ◽  
Fixed Priority ◽  
Fixed Priority Scheduling ◽  
Rate Monotonic ◽  
Simple Implementation ◽  
Deadline Monotonic ◽  
Activation Rates

This papercarries out a survey of sufficient schedulability analysis forfixed priority (FP) scheduling. The most common used fixed priority assignment is the rate monotonic (RM) algorithm, according to its policy, the task priorities are ordered based on their activation rates, so that the task with the shortest period is assigned the highest priority. However, when each task’s relative deadline is not equal to its period, the RM algorithm is not suitable to assign the task priorities. When relative deadlines are less than or equal to periods,the deadline monotonic (DM) algorithm can be deployed to schedule the tasks. The utilization based schedulability analysis has the advantage of simple implementation, and manyexisting schedulability analyses on uniprocessor are covered.

Sign in / Sign up

Export Citation Format

Share Document