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

  • Friedrich Eisenbrand
  • Thomas Rothvoß
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5125)

Abstract

We present a polynomial time approximation scheme for the real-time scheduling problem with fixed priorities when resource augmentation is allowed. For a fixed ε> 0, our algorithm computes an assignment using at most (1 + εOPT + 1 processors in polynomial time, which is feasible if the processors have speed 1 + ε. We also show that, unless P = NP, there does not exist an asymptotic FPTAS for this problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Friedrich Eisenbrand
    • 1
  • Thomas Rothvoß
    • 1
  1. 1.Institute of MathematicsÉcole Polytechnique Féderale de LausanneLausanneSwitzerland

Personalised recommendations