Tardiness bounds for global EDF with deadlines different from periods

Authors:
Jeremy Erickson;Nan Guan;Sanjoy Baruah
Affiliations:
The University of North Carolina at Chapel Hill, Chapel Hill, NC;Uppsala University, Uppsala, Sweden;The University of North Carolina at Chapel Hill, Chapel Hill, NC
Venue:
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Year:
2010

Citing 3
Cited 2

Tardiness bounds under global EDF scheduling on a multiprocessor

Real-Time Systems
Generalized tardiness bounds for global multiprocessor scheduling

Real-Time Systems
Improved Tardiness Bounds for Global EDF

ECRTS '10 Proceedings of the 2010 22nd Euromicro Conference on Real-Time Systems

Response time bounds for G-EDF without intra-task precedence constraints

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an attractive choice for scheduling soft-real-time systems on multiprocessors. Previous work has demonstrated that the maximum tardiness is bounded, and has derived formulas for computing tardiness bounds, in EDF-scheduled real-time systems that can be modeled as collections of recurrent tasks modeled using the well-known implicit-deadline (Liu and Layland) task model. This research extends the applicability of previous techniques to systems that are modeled using the more general arbitrary sporadic task model. It also improves on prior work even for implicit-deadline systems. An algorithm is derived here that computes tardiness bounds in polynomial time. Previously, these bounds could only have been approximated in sub-exponential time.