Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
- 133 Downloads
This paper examines the relative effectiveness of fixed priority pre-emptive scheduling in a uniprocessor system, compared to an optimal algorithm such as Earliest Deadline First (EDF).
The quantitative metric used in this comparison is the processor speedup factor, equivalent to the factor by which processor speed needs to increase to ensure that any taskset that is schedulable according to an optimal scheduling algorithm can be scheduled using fixed priority pre-emptive scheduling, assuming an optimal priority assignment policy.
For constrained-deadline tasksets where all task deadlines are less than or equal to their periods, the maximum value for the processor speedup factor is shown to be 1/Ω≈1.76322 (where Ω is the mathematical constant defined by the transcendental equation ln (1/Ω)=Ω, hence, Ω≈0.567143). Further, for implicit-deadline tasksets where all task deadlines are equal to their periods, the maximum value for the processor speedup factor is shown to be 1/ln (2)≈1.44270. The derivation of this latter result provides an alternative proof of the well-known Liu and Layland result.
KeywordsReal-time Uniprocessor Fixed priority pre-emptive scheduling Earliest Deadline First (EDF) Sub-optimality Processor speedup factor Constrained deadline Implicit deadline Omega constant
Unable to display preview. Download preview PDF.
- Baruah S, Burns A (2006) Sustainable scheduling analysis. In: Proceedings of the IEEE real-time systems symposium, pp 159–168 Google Scholar
- Baruah S, Burns A (2008) Quantifying the sub-optimality of uniprocessor fixed priority scheduling. In: Proceedings of the IEEE international conference on real-time and network systems, pp 89–95 Google Scholar
- Baruah SK, Mok AK, Rosier LE (1990b) Preemptively scheduling hard-real-time sporadic tasks on one processor. In: Proceedings of the IEEE real-time system symposium, pp 182–190 Google Scholar
- Dertouzos ML (1974) Control robotics: the procedural control of physical processes. In: Proceedings of the IFIP congress, pp 807–813 Google Scholar
- Fineberg MS, Serlin O (1967) Multiprogramming for hybrid computation. In: Proceedings AFIPS fall joint computing conference, pp 1–13 Google Scholar
- Kalyanasundaram B, Pruhs K (1995) Speed is as powerful as clairvoyance. In: Proceedings of the 36th symposium on foundations of computer science, pp 214–221 Google Scholar
- Lehoczky JP, Sha L, Ding Y (1989) The rate monotonic scheduling algorithm: Exact characterization and average case behaviour. In: Proceedings of the IEEE real-time systems symposium, pp 166–171 Google Scholar
- Mok AK (1983) Fundamental design problems of distributed systems for the hard-real-time environment. PhD Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts Google Scholar
- Sjodin M, Hansson H (1998) Improved response time analysis calculations. In: Proceedings of the 19th IEEE real-time systems symposium, pp 399–408 Google Scholar
- Tindell KW (1994) Fixed priority scheduling of hard real-time systems. PhD thesis, Department of Computr Science, University of York Google Scholar