Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems
- 19 December 2007
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
Fixed Task Priority (FTP) scheduling algorithms are priority-driven scheduling algorithms in which all jobs generated by each recurrent task are restricted to have the same priority. The multiprocessor FTP scheduling of sporadic task systems is studied in this paper. A new sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guarantees, including a processor speedup bound.Keywords
This publication has 8 references indexed in Scilit:
- Schedulability Analysis of Multiprocessor Sporadic Task SystemsPublished by Informa UK Limited ,2007
- An Analysis of Fixed-Priority Schedulability on a MultiprocessorReal-Time Systems, 2006
- Algorithms for Determining the Demand-Based Load of a Sporadic Task SystemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Hard Real-Time Computing SystemsReal-Time Systems Series, 2005
- A Practitioner’s Handbook for Real-Time AnalysisPublished by Springer Science and Business Media LLC ,1993
- Preemptively scheduling hard-real-time sporadic tasks on one processorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- On the complexity of fixed-priority scheduling of periodic, real-time tasksPerformance Evaluation, 1982
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973