Tardiness Bounds under Global EDF Scheduling on a Multiprocessor

Authors:
UmaMaheswari C. Devi;James H. Anderson
Affiliations:
University of North Carolina at Chapel Hill;University of North Carolina at Chapel Hill
Venue:
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Year:
2005

Citing 0
Cited 11

Tardiness bounds under global EDF scheduling on a multiprocessor

Real-Time Systems
An $\mathsf{EDF}$ -based restricted-migration scheduling algorithm for multiprocessor soft real-time systems

Real-Time Systems
Task reweighting under global scheduling on multiprocessors

Real-Time Systems
Utility accrual real-time scheduling for multiprocessor embedded systems

Journal of Parallel and Distributed Computing
T-L plane-based real-time scheduling for homogeneous multiprocessors

Journal of Parallel and Distributed Computing
Generalized tardiness bounds for global multiprocessor scheduling

Real-Time Systems
Flexible tardiness bounds for sporadic real-time task systems on multiprocessors

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Real-Time Systems
Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

Real-Time Systems
On multiprocessor utility accrual real-time scheduling with statistical timing assurances

EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Supporting soft real-time parallel applications on multiprocessors

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the scheduling of soft real-time sporadic task systems under global EDF on an identical multiprocessor. Prior research on global EDF has focussed mostly on hard real-time systems, where, to ensure that all deadlines are met, approximately 50% of the available processing capacity will have to be sacrificed in the worst case. This may be overkill for soft real-time systems that can tolerate bounded tardiness. In this paper, we derive tardiness bounds under preemptive and non-preemptive global EDF on multiprocessors when the total utilization of a task system is not restricted and may equal the number of processors. Our tardiness bounds depend on per-task utilizations and execution costs — the lower these values, the lower the tardiness bounds. As a final remark, we note that global EDF may be superior to partitioned EDF for multiprocessor-based soft real-time systems in that the latter does not offer any scope to improve system utilization even if bounded tardiness can be tolerated.