DocumentCode
2909367
Title
The Partitioned EDF Scheduling of Sporadic Task Systems
Author
Baruah, Sanjoy
fYear
2011
fDate
Nov. 29 2011-Dec. 2 2011
Firstpage
116
Lastpage
125
Abstract
The partitioned scheduling of sporadic task systems on identical multiprocessors is considered. This is known to be intractable (NP-hard in the strong sense). A polynomial-time approximation scheme (PTAS) is proposed for sporadic task systems satisfying the additional constraint that for each of the three parameters -- worst-case execution time, relative deadline, and period -- that characterize sporadic tasks, the ratio of the largest value to the smallest value is bounded from above by a constant.
Keywords
multiprocessing systems; polynomial approximation; processor scheduling; task analysis; PTAS; identical multiprocessor; partitioned EDF scheduling; polynomial-time approximation scheme; relative deadline; sporadic task system; worst-case execution time; Algorithm design and analysis; Approximation algorithms; Partitioning algorithms; Polynomials; Processor scheduling; Program processors; Scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Real-Time Systems Symposium (RTSS), 2011 IEEE 32nd
Conference_Location
Vienna
ISSN
1052-8725
Print_ISBN
978-1-4577-2000-0
Type
conf
DOI
10.1109/RTSS.2011.18
Filename
6121431
Link To Document