A constant-approximate feasibility test for multiprocessor real-time scheduling

Algorithmica

Volumn 62, Issue 3-4, 2012, Pages 1034-1049

  Bonifaci, Vincenzo ^a   Marchetti Spaccamela, Alberto ^b   Stiller, Sebastian ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Approximation algorithm; Earliest Deadline First; Feasibility test; Multiprocessor; Real time scheduling; Sporadic task system

Indexed keywords

APPROXIMATION ALGORITHMS; MULTIPROCESSING SYSTEMS; REAL TIME SYSTEMS; SCHEDULING;

EARLIEST DEADLINE FIRST; FEASIBILITY TESTS; MULTIPROCESSOR; REAL - TIME SCHEDULING; SPORADIC TASK SYSTEMS;

RESPONSE TIME (COMPUTER SYSTEMS);

EID: 79551552399     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-011-9497-2     Document Type: Article

References (19)

1. Albers, K., Slomka, F.: An event stream driven approximation for the analysis of real-time systems. In: Proceedings of the 16th Euromicro Conference on Real-Time Systems, pp. 187-195. IEEE Press, New York (2004)
2. Albers, K., Slomka, F.: Efficient feasibility analysis for real-time systems with EDF scheduling. In: Proceedings of the Conference on Design, Automation and Test in Europe, pp. 492-497. IEEE Press, New York (2005)
3. Baker, T.P.: An analysis of EDF schedulability on a multiprocessor. IEEE Trans. Parallel Distrib. Syst. 16(8), 760-768 (2005)
4. Baker, T.P., Baruah, S.K.: Schedulability analysis of multiprocessor sporadic task systems. In: Son, S.H., Lee, I., Leung, J.Y.T. (eds.) Handbook of Real-Time and Embedded Systems. CRC Press, Boca Raton (2007). Chapter 3
5. Baker, T.P., Baruah, S.K.: An analysis of global EDF schedulability for arbitrary-deadline sporadic task systems. Real-Time Syst. 43(1), 3-24 (2009)
6. Baruah, S.K., Baker, T.P.: Schedulability analysis of global EDF. Real-Time Syst. 38(3), 223-235 (2008)
7. Baruah, S.K., Howell, R.R., Rosier, L.E.: Feasibility problems for recurring tasks on one processor. Theor. Comput. Sci. 118(1), 3-20 (1993)
8. Bonifaci, V., Chan, H.-L., Marchetti-Spaccamela, A., Megow, N.: Algorithms and complexity for periodic real-time scheduling. In: Charikar, M. (ed.) Proceedings of the 21st Symposium on Discrete Algorithms, pp. 1350-1359. SIAM, Philadelphia (2010)
9. Chakraborty, S., Künzli, S., Thiele, L.: Approximate schedulability analysis. In: Proceedings of the 23rd Real-Time Systems Symposium, pp. 159-168. IEEE Press, New York (2002)
10. Dertouzos, M.L.: Control robotics: The procedural control of physical processes. In: Proceedings of the International Federation for Information Processing Congress, pp. 807-813. North-Holland, Amsterdam (1974)
11. Eisenbrand, F., Rothvoß, T.: A PTAS for static priority real-time scheduling with resource augmentation. In: Proceedings of the 35th International Colloquium on Automata, Languages and Programming, pp. 246-257. Springer, Berlin (2008)
12. Eisenbrand, F., Rothvoß, T.: EDF-schedulability of synchronous periodic task systems is coNP-hard. In: Proceedings of the 21st Symposium on Discrete Algorithms, pp. 1029-1034. SIAM, Philadelphia (2010)
13. Fisher, N., Baruah, S.K.: A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines. In: Proceedings of the 17th Euromicro Conference on Real-Time Systems, pp. 117-126. IEEE Press, New York (2005)
14. Fisher, N., Goossens, J., Baruah, S.K.: Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible. Real-Time Syst. 45(1), 26-71 (2010)
15. Lam, T.W., To, K.-K.: Trade-offs between speed and processor in hard-deadline scheduling. In: Proceedings of the 10th Symposium on Discrete Algorithms, pp. 623-632. SIAM, Philadelphia (1999)
16. Leung, J.Y.-T., Merrill, M.L.: A note on preemptive scheduling of periodic, real-time tasks. Inf. Process. Lett. 11(3), 115-118 (1980)
17. Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46-61 (1973)
18. Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. Algorithmica 32(2), 163-200 (2002)
19. Srinivasan, A., Anderson, J.H.: Optimal rate-based scheduling on multiprocessors. J. Comput. Syst. Sci. 72(6), 1094-1117 (2006)