Paper Info
Title
An analysis of global edf schedulability for arbitrary-deadline sporadic task systems
Abstract
Recent results on the global multiprocessor edf scheduling of sporadic task systems are, for the most part, applicable only to task systems in which each task's relative deadline parameter is constrained to be no larger than its minimum inter-arrival separation. This paper introduces new analysis techniques that allow for similar results to be derived for task systems in which individual tasks are not constrained in this manner. For tasks with deadlines greater than their minimum inter-arrival separation, two models are considered, with and without an implicit intra-task job precedence constraint. The new analyses yield schedulability conditions that strictly dominate some previously proposed tests that are generally accepted to represent the current state of the art in multiprocessor edf schedulability analysis, and permits the derivation of an improved speed-up bound.
Year
DOI
Venue
2009
10.1007/s11241-009-9075-8
Realtime systems
Keywords
Field
DocType
multiprocessor edf schedulability analysis,global multiprocessor edf scheduling,multiprocessor scheduling · sporadic task systems · arbitrary deadlines · edf · earliest deadline first · global scheduling · schedulability analysis,schedulability condition,global edf schedulability,arbitrary-deadline sporadic task system,individual task,new analysis technique,minimum inter-arrival separation,sporadic task system,task system,new analysis,current state,earliest deadline first,multiprocessor scheduling
Metrical task system,Multiprocessor scheduling,Computer science,Scheduling (computing),Parallel computing,Multiprocessing,Global scheduling,Real-time computing,Earliest deadline first scheduling,Distributed computing
Journal
Volume
Issue
ISSN
43
1
0922-6443
Citations 
PageRank 
References 
18
0.85
22
Authors
2
Name
Order
Citations
PageRank
T. P. Baker11648171.36
Sanjoy K. Baruah24664374.79