Assigning sporadic tasks to unrelated parallel machines

Authors:
Alberto Marchetti-Spaccamela;Cyriel Rutten;Suzanne van der Ster;Andreas Wiese
Affiliations:
Sapienza University of Rome, Rome, Italy;Maastricht University, Maastricht, The Netherlands;Vrije Universiteit, Amsterdam, The Netherlands;Sapienza University of Rome, Rome, Italy
Venue:
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Year:
2012

Citing 17
Cited 0

Approximation algorithms for scheduling unrelated parallel machines

Mathematical Programming: Series A and B
Improved approximation schemes for scheduling unrelated parallel machines

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Approximate Schedulability Analysis

RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
An Event Stream Driven Approximation for the Analysis of Real-Time Systems

ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
The Partitioned Multiprocessor Scheduling of Sporadic Task Systems

RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities

ECRTS '06 Proceedings of the 18th Euromicro Conference on Real-Time Systems
Graph balancing: a special case of scheduling unrelated parallel machines

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
An efficient approximation scheme for the one-dimensional bin-packing problem

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Improved multiprocessor global schedulability analysis

Real-Time Systems
EDF-schedulability of synchronous periodic task systems is coNP-hard

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Open problems in real-time scheduling

Journal of Scheduling
Santa Claus schedules jobs on unrelated machines

Proceedings of the forty-third annual ACM symposium on Theory of computing
Meeting deadlines: how much speed suffices?

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Resource Augmentation Bounds for Approximate Demand Bound Functions

RTSS '11 Proceedings of the 2011 IEEE 32nd Real-Time Systems Symposium
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling

Algorithmica

Quantified Score

Hi-index	0.00

Visualization

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