Dual priority scheduling
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10528725,p. 100-109
- https://doi.org/10.1109/real.1995.495200
Abstract
In this paper, we present a new strategy for scheduling tasks with soft deadlines in real-time systems containing periodic, sporadic and adaptive tasks with hard deadlines. In such systems, much of the spare capacity present is due to sporadic and adaptive tasks not arriving at their maximum rate. Offline methods of identifying spare capacity such as the Deferrable Server or Priority Exchange Algorithm are unable to make this spare capacity available as anything other than a background service opportunity for soft tasks. Further, more recent methods such as dynamic Slack Stealing require computationally expensive re-evaluation of the available slack in order to reclaim such spare capacity. By comparison, the Dual Priority approach presented in this paper provides an efficient and effective means of scheduling soft task in this case.Keywords
This publication has 8 references indexed in Scilit:
- Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Scheduling slack time in fixed priority pre-emptive systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fixed priority scheduling periodic tasks with varying execution priorityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An extendible approach for analyzing fixed priority hard real-time tasksReal-Time Systems, 1994
- Applying new scheduling theory to static priority pre-emptive schedulingSoftware Engineering Journal, 1993
- Dual Priority Assignment: A Practical Method For Increasing Processor UtilisationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- Fixed priority scheduling of periodic task sets with arbitrary deadlinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Some Results of the Earliest Deadline Scheduling AlgorithmIEEE Transactions on Software Engineering, 1989