The Space of Rate Monotonic Schedulability

Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic tasks. They can be divided in two main classes: polynomial time tests and exact tests. Polynomial time tests are used for on-line guarantee of dynamic systems, where tasks can be activated at runtime. These tests introduce a negligible overhead, when executed upon a new task arrival, however provide only a sufficient schedulability condition, which may cause a poor processor utilization. On the other hand, exact tests, which are based on response time analysis, provide a necessary and sufficient schedulability condition, but are too complex to be executed on line for large task sets. As a consequence, for large task sets, they are often executed off line. This paper proposes a novel approach for analyzing the schedulability of periodic task sets under the Rate Monotonic priority assignment. Using this appro...

• Type: Conference
• Year: 2002
• Where: RTSS
• Authors: Enrico Bini, Giorgio C. Buttazzo
• Keywords: Control Systems, Polynomial Time Tests, RTSS 2002, Sufficient Schedulability Condition, Task Sets