Implementation of a Speedup-Optimal Global EDF Schedulability Test

Author

Baruah, Sanjoy ; Bonifaci, Vincenzo ; Marchetti-Spaccamela, Alberto ; Stiller, Sebastian

Author_Institution

Univ. of North Carolina at Chapel Hill, Chapel Hill, NC, USA

fYear

2009

fDate

1-3 July 2009

Firstpage

259

Lastpage

268

Abstract

Recent results have demonstrated the existence of a sufficient global EDF schedulability test for sporadic task systems that makes the following guarantee: any task system that is not determined to be schedulable on an m-processor platform by this test is guaranteed to actually not be so on a platform in which each processor is m/(2m - 1) times as fast. A new global EDF schedulability test is proposed here that builds on this result. This new test is shown to be less pessimistic and more widely applicable than the earlier result was, while retaining the strong theoretical properties - in particular, the speedup bound - of the earlier result.

Keywords

processor scheduling; m-processor platform; speedup-optimal global EDF schedulability; sporadic task systems; Computational complexity; Contracts; FETs; Processor scheduling; Real time systems; Scheduling algorithm; Sun; System testing; Multiprocessor scheduling; global EDF scheduling; processor speedup factor; schedulability analysis; sporadic task systems;

fLanguage

English

Publisher

ieee

Conference_Titel

Real-Time Systems, 2009. ECRTS '09. 21st Euromicro Conference on

Conference_Location

Dublin

ISSN

1068-3070

Print_ISBN

978-0-7695-3724-5

Type

conf

DOI

10.1109/ECRTS.2009.31

Filename

5161521