Algorithms for scheduling hard aperiodic tasks in fixed-priority systems using slack stealing
- 1 January 1994
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper discusses the problem of jointly scheduling hard deadline periodic tasks and hard deadline aperiodic tasks using fixed priority methods. The approach is based on the slack stealing algorithm developed by the authors, and it assumes that the periodic deadlines must all be met. The paper develops a hard aperiodic acceptance test algorithm for guaranteeing tasks at any priority level, and it corrects an error in the original guarantee algorithm presented in Ramos-Thuel and Lehoczky (1993). It is shown that there is no optimal priority assignment for hard aperiodic task, but guidelines are given for choosing a good priority assignment.Keywords
This publication has 10 references indexed in Scilit:
- An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On-line scheduling of hard deadline aperiodic tasks in fixed-priority systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Scheduling slack time in fixed priority pre-emptive systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Timing analysis for fixed-priority scheduling of hard real-time systemsIEEE Transactions on Software Engineering, 1994
- Dynamic scheduling of hard real-time tasks and real-time threadsIEEE Transactions on Software Engineering, 1992
- Scheduling hard real-time systems: a reviewSoftware Engineering Journal, 1991
- Some Results of the Earliest Deadline Scheduling AlgorithmIEEE Transactions on Software Engineering, 1989
- Finding Response Times in a Real-Time SystemThe Computer Journal, 1986
- On the complexity of fixed-priority scheduling of periodic, real-time tasksPerformance Evaluation, 1982
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973