TY - GEN
T1 - Hybrid-priority real-time scheduling
AU - Baruah, Sanjoy
AU - Fisher, Nathan
PY - 2008
Y1 - 2008
N2 - A hybrid scheduling algorithm is proposed, which integrates features of the Fixed Priority (FP) and Earliest Deadline First (EDF) scheduling policies. It is shown that this hybrid scheduling algorithm is a generalization of both FP and EDF, and tends to retain most of the desirable properties and features of both individual policies. Two exact (i.e., necessary and sufficient) tests are derived for sporadic task systems scheduled by the hybrid scheduling algorithm.
AB - A hybrid scheduling algorithm is proposed, which integrates features of the Fixed Priority (FP) and Earliest Deadline First (EDF) scheduling policies. It is shown that this hybrid scheduling algorithm is a generalization of both FP and EDF, and tends to retain most of the desirable properties and features of both individual policies. Two exact (i.e., necessary and sufficient) tests are derived for sporadic task systems scheduled by the hybrid scheduling algorithm.
KW - Earliest-deadline first
KW - Fixed-priority scheduling
KW - Hybrid scheduling
KW - Schedulability analysis
KW - Sporadic tasks
UR - https://www.scopus.com/pages/publications/51049100632
U2 - 10.1109/IPDPS.2008.4536564
DO - 10.1109/IPDPS.2008.4536564
M3 - Conference contribution
AN - SCOPUS:51049100632
SN - 9781424416943
T3 - IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM
BT - IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM
T2 - IPDPS 2008 - 22nd IEEE International Parallel and Distributed Processing Symposium
Y2 - 14 April 2008 through 18 April 2008
ER -