Uniprocessor EDF Scheduling with Mode Change
Ref: HURRAY-TR-081001 Publication Date: 15 to 18, Dec, 2008
Uniprocessor EDF Scheduling with Mode Change
Ref: HURRAY-TR-081001 Publication Date: 15 to 18, Dec, 2008Abstract:
Consider the problem of scheduling sporadically-arriving tasks with implicit deadlines using Earliest-Deadline-First (EDF) on a single processor. The system may undergo changes in its operational modes and therefore the characteristics of the task set may change at run-time. We consider a well-established previously published mode-change protocol by Sha et al. and we show that if every mode utilizes at most 50% of the processing capacity then all deadlines are met. We also show that there exists a task set that misses a deadline although the utilization exceeds 50% by just an arbitrarily small amount. Finally, we present, for a relevant special case, an exact schedulability test for EDF with mode change.
Björn AnderssonDocument:
View
Download12th International Conference on Principles of Distributed Systems (OPODIS 2008), Springer Berlin Heidelberg, Edited: Theodore P.
Baker, Alain Bui, Sébastien Tixeuil, 5401, pp 572-577.
Luxor, Egypt.
DOI:10.1007/978-3-540-92221-6_43.
WOS ID: 000263683700041.
Notes: In Lecture Notes in Computer Science Series
Record Date: 1, Dec, 2008
Short links for this page: www.cister-labs.pt/docs/10_1007_978_3_540_92221_6_43 www.cister-labs.pt/docs/000263683700041 www.cister-labs.pt/docs/hurray_tr_081001 www.cister-labs.pt/docs/414