A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation

Authors:
Friedrich Eisenbrand;Thomas Rothvoß
Affiliations:
Institute of Mathematics, École Polytechnique Féderale de Lausanne, Lausanne, Switzerland 1015;Institute of Mathematics, École Polytechnique Féderale de Lausanne, Lausanne, Switzerland 1015
Venue:
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Year:
2008

Citing 0
Cited 4

Polyhedral and algorithmic properties of quantified linear programs

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Open problems in real-time scheduling

Journal of Scheduling
A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Assigning sporadic tasks to unrelated parallel machines

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a polynomial time approximation scheme for thereal-time scheduling problem with fixed priorities whenresource augmentation is allowed. For a fixedε 0, our algorithm computes an assignmentusing at most (1 + ε)·OPT + 1processors in polynomial time, which is feasible if the processorshave speed 1 + ε. We also show that, unlessP = NP, there does not exist an asymptotic FPTASfor this problem.