Assigning sporadic tasks to unrelated parallel machines

A. Marchetti-Spaccamela*, C. Rutten, S. van der Ster, A. Wiese

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic


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.
Original languageEnglish
Title of host publicationAutomata, Languages and Programming
EditorsA. Czumaj, K. Melhorn
Place of PublicationBerlin
ISBN (Print)978-3-642-31593-0
Publication statusPublished - 1 Jan 2012

Publication series

SeriesLecture Notes in Computer Science

Cite this