Quantifying the Sub-optimality of Uniprocessor Fixed Priority Non-Pre-emptive Scheduling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

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

Dates and versions

inria-00536363 , version 1 (16-11-2010)

Identifiers

  • HAL Id : inria-00536363 , version 1

Cite

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. ⟨inria-00536363⟩
514 View
192 Download

Share

Gmail Facebook Twitter LinkedIn More