December 2017
Intermediate to advanced
534 pages
14h 57m
English
13.2 Sufficient Schedulability Test for Rate Monotonic
The previous chapter introduced the basic concepts in process scheduling and analyzed the two classes of scheduling algorithms: fixed priority and variable priority. When considering fixed-priority scheduling, it has been shown that Rate Monotonic (RM) Scheduling is optimal, that is, if a task set is schedulable under any-fixed priority schema, then it will be under RM. For variable-priority assignment, the optimality of Earliest Deadline First (EDF) has been enunciated and will be proved in this chapter. ...
Read now
Unlock full access