Increasingly, real-time systems must handle the self-suspension of tasks (that is, lower-bound wait times between subtasks) in a timely and predictable manner. A fast schedulability test that does not significantly overestimate the temporal resources needed to execute self-suspending task sets would be of benefit to these modern computing systems. In this paper, a polynomial-time test is presented that is known to be the first to handle nonpreemptive self-suspending task sets with hard deadlines, where each task has any number of self-suspensions. To construct the test, a novel priority scheduling policy is leveraged, the th subtask first, which restricts the behavior of the self-suspending model to provide an analytical basis for an informative schedulability test. In general, the problem of sequencing according to both upper-bound and lower-bound temporal constraints requires an idling scheduling policy and is known to be nondeterministic polynomial-time hard. However, the tightness of the schedulability test and scheduling algorithm are empirically validated, and it is shown that the processor is able to effectively use up to 95% of the self-suspension time to execute tasks.
Schedulability Analysis of Task Sets with Upper- and Lower-Bound Temporal Constraints
Journal of Aerospace Information Systems ; 11 , 12 ; 821-841
2014-12-15
21 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Schedulability Analysis of Task Sets with Upper- and Lower-Bound Temporal Constraints
DSpace@MIT | 2014
|Schedulability analysis software
Online Contents | 1993
Schedulability-Driven Implementation Selection
British Library Conference Proceedings | 1995
|British Library Conference Proceedings | 2012
|