Logo image
A precise schedulability test algorithm for scheduling periodic tasks in real-time systems
Conference paper

A precise schedulability test algorithm for scheduling periodic tasks in real-time systems

Wan-Chen Lu, Jen-Wei Hsieh and Wei-Kuan Shih
Proceedings of the ACM Symposium on Applied Computing, Vol.2, pp.1451-1455
2006

Abstract

Fixed priority preemptive scheduling Periodic tasks Rate monotonic analysis Real-time systems Schedulability test
Rate monotonic analysis (RMA) has been shown to be effective in the schedulability analysis of various types of system. This paper focuses on reducing the run time of each RMA-tested system. Based on a new concept of tasks, denoted by the lift-utilization tasks, we propose a novel method to reduce the number of iterative calculations in the derivation of the worst-case response time of each task in its RMA test. The capability of the proposed method was evaluated and compared to related work, which revealed that our method produced savings of 26-33% in the number of RMA iterations. Copyright 2006 ACM.

Metrics

1 Record Views

Details

Logo image