Quantifying the Sub-optimality of Uniprocessor Fixed Priority Non-Pre-emptive Scheduling

Abstract : This paper examines the relative effectiveness of fixed priority non-pre-emptive scheduling (FP-NP) in a uniprocessor system, compared to an optimal work-conserving non-pre-emptive algorithm; Earliest Deadline First (EDF-NP). The quantitative metric used in this comparison is the processor speedup factor, defined as the factor by which processor speed needs to increase to ensure that any taskset that is schedulable according to EDF-NP can be scheduled using FP-NP scheduling. For sporadic tasksets with implicit, constrained, or arbitrary deadlines, the speedup factor is shown to be lower bounded by 1/Omega (1.76322) and upper bounded by 2. We also report the results of empirical investigations into the speedup factor required to ensure schedulability in the non-pre-emptive case.
Type de document :
Communication dans un congrès
18th International Conference on Real-Time and Network Systems, Nov 2010, Toulouse, France. pp.1-10, 2010
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00536363
Contributeur : Christine Rochange <>
Soumis le : mardi 16 novembre 2010 - 15:46:20
Dernière modification le : mercredi 7 octobre 2015 - 01:14:21
Document(s) archivé(s) le : jeudi 17 février 2011 - 02:45:42

Fichier

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

Identifiants

  • HAL Id : inria-00536363, version 1

Collections

Citation

Robert Davis, Laurent George, Pierre Courbin. Quantifying the Sub-optimality of Uniprocessor Fixed Priority Non-Pre-emptive Scheduling. 18th International Conference on Real-Time and Network Systems, Nov 2010, Toulouse, France. pp.1-10, 2010. 〈inria-00536363〉

Partager

Métriques

Consultations de
la notice

466

Téléchargements du document

214