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

Authors:
Jeremy P. Erickson;James H. Anderson
Affiliations:
University of North Carolina at Chapel Hill;University of North Carolina at Chapel Hill
Venue:
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Year:
2011

Citing 6
Cited 0

Tardiness bounds under global EDF scheduling on a multiprocessor

Real-Time Systems
An analysis of global edf schedulability for arbitrary-deadline sporadic task systems

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
Tardiness bounds for global EDF with deadlines different from periods

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Early-release fair scheduling

Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Prior work has provided bounds on the deadline tardiness that a set of sporadic real-time tasks may incur when scheduled using the global earliest-deadline-first (G-EDF) scheduling algorithm. Under the sporadic task model, it is necessary that no individual task overutilize a single processor and that the set of all tasks does not overutilize the set of all processors. In this work we generalize the task model by allowing jobs within a single task to run concurrently. In doing so we remove the requirement that no task overutilize a single processor. We also provide tardiness bounds that are better than those available with the standard sporadic task model.