Quantifying the sub-optimality of uniprocessor fixed-priority scheduling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

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.
Fichier principal
Vignette du fichier
baruah.pdf (287.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00336484 , version 1 (04-11-2008)

Identifiers

  • HAL Id : inria-00336484 , version 1

Cite

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⟩

Collections

RTNS2008
49 View
73 Download

Share

Gmail Facebook X LinkedIn More