An Efficient Test Method for Rate Monotonic Schedulability

作者：Park Moonju^*; Park Heemin

来源：IEEE Transactions on Computers, 2014, 63(5): 1309-1315.

DOI：10.1109/TC.2012.296

• Real-time scheduling
• rate monotonic
• schedulability

Rate Monotonic scheduling algorithm has been widely used in real-time systems for its optimality in fixed priority scheduling. Determining the Rate Monotonic schedulability of tasks is an important problem when designing a real-time system. There are exact schedulability test methods for Rate Monotonic scheduling, but the worst case response time analysis on which the exact tests are based is NP-hard. So the exact tests are often too complex to be executed on-line for large numbers of tasks. For practical use, polynomial time sufficient conditions for the Rate Monotonic schedulability have been studied. However, existing polynomial time tests are often too pessimistic. In this paper, we propose a new polynomial time sufficient condition based on the response time analysis, which is less pessimistic than existing ones. Simulation results show that our test significantly outperforms the existing tests and has performance close to the exact test.

• 出版日期2014-5