A PTAS for static priority real-time scheduling with resource augmentation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 246-257

  Eisenbrand, Friedrich ^a   Rothvoß, Thomas ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

LINGUISTICS; NUCLEAR PROPULSION; POLYNOMIALS; SCHEDULING; TRANSLATION (LANGUAGES);

FIXED PRIORITIES; POLYNOMIAL-TIME; POLYNOMIAL-TIME APPROXIMATION SCHEME; REAL-TIME SCHEDULING; RESOURCE AUGMENTATION; STATIC PRIORITIES;

POLYNOMIAL APPROXIMATION;

EID: 49049115165     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_21     Document Type: Conference Paper

References (13)

1. Baruah, S., Goossens, J.: Scheduling real-time tasks: Algorithms and complexity. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling - Algorithms, Models, and Performance Analysis, ch. 28. Chapman & Hall/CRC, Boca Raton (2004)
2. Davari, S., Dhall, S.K.: On-line algorithms for allocating periodic-time-critical tasks on multiprocessor systems. Informatica (Slovenia) 19(1) (1995)
3. Dhall, S.K.: Approximation algorithms for scheduling time-critical jobs on multiprocessor systems. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling- Algorithms, Models, and Performance Analysis, ch. 32, Chapman & Hall/CRC, Boca Raton (2004)
4. Fernandez de la Vega, W., Lueker, G.S.: Bin packing can be solved within 1+? in linear time. Combinatorica 1(4), 349-355 (1981)
5. Fisher, N., Baruah, S.: A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines. In: ECRTS 2005: Proceedings of the 17th Euromicro Conference on Real-Time Systems (ECRTS 2005), pp. 117-126. IEEE Computer Society, Los Alamitos (2005)
6. Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979)
7. Johnson, D.S.: The NP-completeness column: an ongoing guide. J. Algorithms 13(3), 502-524 (1992)
8. Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: 23rd annual symposium on foundations of computer science, Chicago, Ill., pp. 312-320. IEEE, New York (1982)
9. Lenstra, H.W.: Integer programming with a fixed number of variables. Mathematics of Operations Research 8(4), 538-548 (1983)
10. Liebeherr, J., Burchard, A., Oh, Y., Son, S.H.: New strategies for assigning real-time tasks to multiprocessor systems. IEEE Trans. Comput. 44(12), 1429-1442 (1995)
11. Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46-61 (1973)
12. Oh, Y., Son, S.H.: Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Syst. 9(3), 207-239 (1995)
13. Schuurman, P., Woeginger, G.: Approximation schemes - a tutorial. In: Möhring, R.H., Potts, C.N., Schulz, A.S., Woeginger, G.J., Wolsey, L.A. (eds.) Lectures on Scheduling (to appear, 2007)