A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation
- Cite this paper as:
- Eisenbrand F., Rothvoß T. (2008) A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation. In: Aceto L., Damgård I., Goldberg L.A., Halldórsson M.M., Ingólfsdóttir A., Walukiewicz I. (eds) Automata, Languages and Programming. ICALP 2008. Lecture Notes in Computer Science, vol 5125. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.