Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling

Authors:
Robert I. Davis;Thomas Rothvoβ;Sanjoy K. Baruah;Alan Burns
Affiliations:
Real-Time Systems Research Group, Department of Computer Science, University of York, York, UK;Ecole Polytechnique Federale de Lausanne, Institute of Mathematics, Lausanne, Switzerland 1015;Department of Computer Science, University of North Carolina, Chapel Hill, USA 27599-317;Real-Time Systems Research Group, Department of Computer Science, University of York, York, UK
Venue:
Real-Time Systems
Year:
2009

Citing 8
Cited 8

Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Speed is as powerful as clairvoyance [scheduling problems]

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Improved Response-Time Analysis Calculations

RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Rate Monotonic Analysis: The Hyperbolic Bound

IEEE Transactions on Computers
Measuring the Performance of Schedulability Tests

Real-Time Systems
Sustainable Scheduling Analysis

RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Multiprogramming for hybrid computation

AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference

Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling

Real-Time Systems
Power efficient rate monotonic scheduling for multi-core systems

Journal of Parallel and Distributed Computing
Timing faults and mixed criticality systems

Dependable and Historic Computing
Resource augmentation for fault-tolerance feasibility of real-time tasks under error bursts

Proceedings of the 20th International Conference on Real-Time and Network Systems
Real-time scheduling with resource sharing on uniform multiprocessors

Proceedings of the 20th International Conference on Real-Time and Network Systems
An EDF run-time profile based on ravenscar

ACM SIGAda Ada Letters
Real-time scheduling with resource sharing on heterogeneous multiprocessors

Real-Time Systems
A review of fixed priority and EDF scheduling for hard real-time uniprocessor systems

ACM SIGBED Review - Special Issue on the 3rd Embedded Operating System Workshop (EWiLi 2013)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.