Exploiting precedence relations in the schedulability analysis of distributed real-time systems
Authors:
- M.G. HarbourMHM.G. Harbour
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10528725,p. 328-339
Abstract
In this paper we present improved techniques for the schedulability analysis of tasks with precedence relations in multiprocessor and distributed systems scheduled under a pre-emptive fixed priority scheduler. Recently developed techniques, based on the analysis of tasks with dynamic offsets, take into account the precedence relations between tasks only indirectly, through terms iteratively estimated from the response times of the tasks. With the techniques presented in this paper, we exploit the precedence relations in a more accurate way, and we also take advantage of the priority structure of the different tasks. These considerations permit a significant improvement of the results of the analysis applied to distributed and multiprocessor systems.Keywords
This publication has 8 references indexed in Scilit:
- Best-case analysis for improving the worst-case schedulability test for distributed hard real-time systems2002
- Schedulability analysis for tasks with static and dynamic offsets2002
- On the schedulability analysis for distributed hard real-time systems2002
- Holistic schedulability analysis for distributed hard real-time systemsMicroprocessing and Microprogramming, 1994
- A Practitioner’s Handbook for Real-Time Analysis1993
- Priority inheritance protocols: an approach to real-time synchronizationIEEE Transactions on Computers, 1990
- Fixed priority scheduling of periodic task sets with arbitrary deadlines1990
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973