Robustness results concerning EDF scheduling upon uniform multiprocessors

Authors:
Sanjoy K. Baruah
Affiliations:
-
Venue:
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Year:
2002

Citing 0
Cited 1

A deadline-based algorithm for dynamic task scheduling with precedence constraints

PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The earliest-deadline-first (EDF) scheduling of hard-real-time systems upon uniform multiprocessor machines is considered. It is shown that EDF scheduling upon uniform multiproecssors is robust with respect to processor computing capacity. This result is used to derive a new multiprocessor EDF -feasibility analysis algorithm, which is superior to previously-proposed algorithms.