### 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.

Original language | English |
---|---|

Title of host publication | Automata, Languages and Programming |

Editors | A. Czumaj, K. Melhorn |

Place of Publication | Berlin |

Publisher | Springer |

Pages | 665-676 |

ISBN (Print) | 978-3-642-31593-0 |

DOIs | |

Publication status | Published - 1 Jan 2012 |

### Publication series

Series | Lecture Notes in Computer Science |
---|---|

Number | 7391 |

## Cite this

Marchetti-Spaccamela, A., Rutten, C., van der Ster, S., & Wiese, A. (2012). Assigning sporadic tasks to unrelated parallel machines. In A. Czumaj, & K. Melhorn (Eds.),

*Automata, Languages and Programming*(pp. 665-676). Springer. Lecture Notes in Computer Science, No. 7391 https://doi.org/10.1007/978-3-642-31594-7_56