TY - GEN
T1 - The partitioned EDF scheduling of sporadic task systems
AU - Baruah, Sanjoy
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84856525398
U2 - 10.1109/RTSS.2011.18
DO - 10.1109/RTSS.2011.18
M3 - Conference contribution
AN - SCOPUS:84856525398
SN - 9780769545912
T3 - Proceedings - Real-Time Systems Symposium
SP - 116
EP - 125
BT - Proceedings - 2011 32nd IEEE Real-Time Systems Symposium, RTSS 2011
T2 - 2011 32nd IEEE Real-Time Systems Symposium, RTSS 2011
Y2 - 29 November 2011 through 2 December 2011
ER -