Scheduling periodic tasks in a hard real-time environment

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

Volumn 6198 LNCS, Issue PART 1, 2010, Pages 299-311

  Eisenbrand, Friedrich ^a   Hähnle, Nicolai ^a   Niemeier, Martin ^a   Skutella, Martin ^b   Verschae, José ^b   Wiese, Andreas ^b  

^a EPFL   (Switzerland)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC APPROXIMATION; HARD REAL-TIME; IDENTICAL MACHINES; MINIMIZATION PROBLEMS; PERIODIC TASKS; REAL TIME SCHEDULING; RUNNING TIME; SOFTWARE-BASED;

AIRCRAFT CONTROL; ASYMPTOTIC ANALYSIS; LINGUISTICS; OPTIMIZATION; SCHEDULING; SOFTWARE DESIGN; TRANSLATION (LANGUAGES);

AIRCRAFT ACCIDENTS;

EID: 77955330300     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14165-2_26     Document Type: Conference Paper

References (20)

1. Bar-Noy, A., Bhatia, R., Naor, J., Schieber, B.: Minimizing service and operation costs of periodic scheduling. Math. Oper. Res. 27 (3) (2002)
2. Bhatia, R.: Approximation Algorithms for Scheduling Problems. PhD thesis, University of Maryland (1998)
3. Baruah, S. K., Howell, R. R., Rosier, L. E.: Feasibility problems for recurring tasks on one processor. In: Selected papers of the 15th International Symposium on Mathematical Foundations of Computer Science, pp. 3-20. Elsevier, Amsterdam (1993)
4. Baruah, S., Rousier, L., Tulchinsky, I., Varvel, D.: The complexity of periodic maintenance. In: Proceedings of the International Computer Symposium (1990)
5. Buttazzo, G. C.: Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications. Springer, Heidelberg (2004)
6. Conforti, M., Di Summa, M., Wolsey, L. A.: The mixing set with divisible capacities. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 435-449. Springer, Heidelberg (2008)
7. Eisenbrand, F., Hähnle, N., Niemeier, M., Skutella, M., Verschae, J., Wiese, A.: Scheduling periodic tasks in a hard real-time environment. Technical report, EPF Lausanne & TU Berlin (February 2010), http://disopt.epf1.ch/webdav/site/disopt/shared/PM-EHNSVW10-report.pdf
8. de la Fernandez Vega, W., Lueker, G. S.: Bin packing can be solved within 1 + ε in linear time. Combinatorica 1, 349-355 (1981)
9. Garey, M. R., Johnson, D. S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freemann, New York (1979)
10. Korst, J., Aarts, E., Lenstra, J. K.: Scheduling periodic tasks. INFORMS Journal on Computing 8, 428-435 (1996)
11. Korst, J., Aarts, E., Lenstra, J. K., Wessels, J.: Periodic multiprocessor scheduling. In: Aarts, E. H. L., van Leeuwen, J., Rem, M. (eds.) PARLE 1991. LNCS, vol. 505, pp. 166-178. Springer, Heidelberg (1991)
12. Karmakar, N., Karp, R. M.: An efficient approximation scheme for the onedimensional binpacking problem. In: Foundations of Computer Science (FOCS), vol. 23, pp. 312-320 (1982)
13. Leung, J. Y.-T.: Handbook of Scheduling: Algorithms, Models and Performance Analysis. Chapman & Hall/CRC (2004)
14. Marcotte, O.: The cutting stock problem and integer rounding. Mathematical Programming 33, 82-92 (1985)
15. Niven, I., Zuckerman, H. S., Montgomery, H. L.: An Introduction to the Theory of Numbers, 5th edn. Wiley, Chichester (1991)
16. Simchi-Levi, D.: New worst-case results for the bin-packing problem. Naval Research Logistics 41, 579-585 (1994)
17. Verhaegh, W. F. J., Aarts, E. H. L.: A polynomial-time algorithm for knapsack with divisible item sizes. Information Processing Letters 62, 217-221 (1997)
18. Wei, W. D., Liu, C. L.: On a periodic maintenance problem. Operations Research Letters 2, 90-93 (1983)
19. Zhao, M., de Farias Jr., I. R.: The mixing-MIR set with divisible capacities. Mathematical Programming 115, 73-103 (2008)
20. Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing 3, 103-128 (2007)