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.
Type de document :
Communication dans un congrès
Giorgio Buttazzo and Pascale Minet. 16th International Conference on Real-Time and Network Systems (RTNS 2008), Oct 2008, Rennes, France. 2008
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00336484
Contributeur : Anne Jaigu <>
Soumis le : mardi 4 novembre 2008 - 11:31:10
Dernière modification le : samedi 11 novembre 2017 - 19:04:02
Document(s) archivé(s) le : lundi 7 juin 2010 - 22:43:07

Fichier

baruah.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00336484, version 1

Collections

Citation

Sanjoy Baruah, Alan Burns. Quantifying the sub-optimality of uniprocessor fixed-priority scheduling. Giorgio Buttazzo and Pascale Minet. 16th International Conference on Real-Time and Network Systems (RTNS 2008), Oct 2008, Rennes, France. 2008. 〈inria-00336484〉

Partager

Métriques

Consultations de la notice

67

Téléchargements de fichiers

85