@inbook{14a6b2e6482a4c4693bce97889b18008,

title = "Assigning sporadic tasks to unrelated parallel machines",

abstract = "We study the problem of assigning sporadic tasks to unrelated machines such that the tasks on each machine can be feasibly scheduled. Despite its importance for modern real-time systems, this problem has not been studied before. We present a polynomial-time algorithm which approximates the problem with a constant speedup factor of 11+43 – v ˜17.9 11+43˜17.911+4\sqrt{3} \approx{17.9} and show that any polynomial-time algorithm needs a speedup factor of at least 2, unless p?=?np. In the case of a constant number of machines we give a polynomial-time approximation scheme. Key to these results are two new relaxations of the demand bound function which yields a sufficient and necessary condition for a task system on a single machine to be feasible.",

author = "A. Marchetti-Spaccamela and C. Rutten and {van der Ster}, S. and A. Wiese",

year = "2012",

month = jan,

day = "1",

doi = "10.1007/978-3-642-31594-7_56",

language = "English",

isbn = "978-3-642-31593-0",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

number = "7391",

pages = "665--676",

editor = "A. Czumaj and K. Melhorn",

booktitle = "Automata, Languages and Programming",

address = "United States",

}