Title :
Hybrid-priority real-time scheduling
Author :
Baruah, Sanjoy ; Fisher, Nathan
Author_Institution :
Univ. of North Carolina, Chapel Hill, NC
Abstract :
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.
Keywords :
real-time systems; scheduling; earliest deadline first scheduling policies; fixed priority scheduling policies; hybrid-priority real-time scheduling; sporadic task system scheduling; Algorithm design and analysis; Embedded system; Processor scheduling; Programming profession; Real time systems; Reflection; Scheduling algorithm; System testing; earliest-deadline first; fixed-priority scheduling; hybrid scheduling; schedulability analysis; sporadic tasks;
Conference_Titel :
Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on
Conference_Location :
Miami, FL
Print_ISBN :
978-1-4244-1693-6
Electronic_ISBN :
1530-2075
DOI :
10.1109/IPDPS.2008.4536564
