Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor (1990)
| Venue: | In Proceedings of the 11th Real-Time Systems Symposium |
| Citations: | 88 - 19 self |
BibTeX
@INPROCEEDINGS{Baruah90preemptivelyscheduling,
author = {Sanjoy K. Baruah and Aloysius K. Mok and Louis E. Rosier},
title = {Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor},
booktitle = {In Proceedings of the 11th Real-Time Systems Symposium},
year = {1990},
pages = {182--190},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we consider the preemptivescheduling of hard-real-time sporadic task systems on one processor. Wefirstgive necessary and sufficient conditions for a sporadic task system to be feasible (i.e., schedulable). The conditions cannot, in general, be tested efficiently (unless P = NP). They do, however, lead to a feasibilitytestthat runs in efficient pseudo-polynomial time for a very large percentage of sporadic task systems. 1 Introduction Scheduling theory as it applies to hard-real-time environments --- environments where the missing of a single deadline may have disastrous consequences --- seems to currently be enjoying a renaissance. Hardreal -time scheduling problems may concern either fixed-duration tasks or recurring tasks that must be completed within a certain time frame. The problems most studied within the recurring category involve periodically recurring tasks [LL73, LM80, LM81, LW82,Mok83, BHR90]. Aperiodically or sporadically recurring tasks have also been stud...
