Skip to Main content Skip to Navigation
Conference papers

Quantifying the sub-optimality of uniprocessor fixed-priority scheduling

Abstract : There are sporadic task systems schedulable by EDF, which no fixed-priority (FP) algorithm can schedule successfully. For instance, it is known that while all implicit-deadline sporadic task systems with utilization at most one are EDF-schedulable on a unit-capacity uniprocessor, there are implicit-deadline sporadic task systems that are not schedulable by any FP algorithm, and have utilization exceeding ln 2 (approx. 0.69) by an arbitrarily small amount. A quantitative metric of the relative effectiveness of fixed-priority scheduling of constrained-deadline sporadic task systems is derived here, which generalizes this well-known 0.69 utilization bound for implicit-deadline systems.
Document type :
Conference papers
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Anne Jaigu Connect in order to contact the contributor
Submitted on : Tuesday, November 4, 2008 - 11:31:10 AM
Last modification on : Tuesday, October 19, 2021 - 12:52:58 PM
Long-term archiving on: : Monday, June 7, 2010 - 10:43:07 PM


Files produced by the author(s)


  • HAL Id : inria-00336484, version 1



Sanjoy Baruah, Alan Burns. Quantifying the sub-optimality of uniprocessor fixed-priority scheduling. 16th International Conference on Real-Time and Network Systems (RTNS 2008), Isabelle Puaut, Oct 2008, Rennes, France. ⟨inria-00336484⟩



Record views


Files downloads