Improved multiprocessor global schedulability analysis

Real-Time Systems

Volumn 46, Issue 1, 2010, Pages 3-24

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

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

^d TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Deadline monotonic; EDF; Global multiprocessor scheduling; Processor speedup factor; Sporadic tasks

Indexed keywords

ANALYSIS TECHNIQUES; DEAD-LINE MONOTONIC; EARLIEST-DEADLINE-FIRST SCHEDULING ALGORITHMS; MULTI PROCESSOR SCHEDULING; MULTI-PROCESSOR PLATFORMS; OPTIMAL SCHEDULER; SCHEDULABILITY ANALYSIS; SCHEDULABILITY TEST; SPEED-UP FACTORS;

MULTIPROCESSING SYSTEMS; NANOTECHNOLOGY; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING ALGORITHMS; TESTING; TREES (MATHEMATICS);

REAL TIME SYSTEMS;

EID: 77955306705     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11241-010-9096-3     Document Type: Conference Paper

References (24)

1. Baker T (2003) Multiprocessor EDF deadline monotonic schedulability analysis. In: Proceedings of the IEEE real-time systems symposium, December 2003. IEEE Computer Society Press, Los Alamitos, pp 120-129
2. TP Baker 2005 An analysis of EDF schedulability on a multiprocessor IEEE Trans Parallel Distrib Syst 16 8 760 768 10.1109/TPDS.2005.88 (Pubitemid 41235917)
3. Baker TP (2005b) Comparison of empirical success rates of global vs. partitioned fixed-priority and EDF scheduling for hard real time. Tech Rep TR-050601, Department of Computer Science, Florida State University, 2005
4. Baker TP (2006) A comparison of global and partitioned EDF schedulability tests for multiprocessors. In: Proceeding of the international conference on real-time and network systems, Poitiers, France, 2006
5. Baker T, Cirinei M (2006) A necessary and sometimes sufficient condition for the feasibility of sets of sporadic hard-deadline tasks. In: Proceedings of the IEEE real-time systems symposium, Rio de Janeiro, December 2006. IEEE Computer Society Press, Los Alamitos, pp 178-187
6. Baker T, Cirinei M (2007) Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks. In: Proceedings of the 10th international conference on principles of distributed systems, Guadeloupe, December 2007, pp 62-75
7. Baruah S (2007a) Schedulability analysis of global deadline-monotonic scheduling. Available at http://www.cs.unc.edu/~baruah
8. Baruah S (2007b) Techniques for multiprocessor global schedulability analysis. In: Proceedings of the real-time systems symposium, Tucson, AZ, December 2007. IEEE Computer Society Press, Los Alamitos, pp 119-128
9. Baruah S, Baker T (2008a) Global EDF schedulability analysis of arbitrary sporadic task systems. In: Proceedings of the EuroMicro conference on real-time systems, Prague, Czech Republic, July 2008. IEEE Computer Society Press, Los Alamitos
10. S Baruah T Baker 2008 Schedulability analysis of global EDF Real-Time Syst 38 3 223 235 1141.68015 10.1007/s11241-007-9047-9
11. Baruah S, Fisher N (2007) Global deadline-monotonic scheduling of arbitrary-deadline sporadic task systems. In: Proceedings of the 11th international conference on principles of distributed systems, Guadeloupe, French West Indies, December 2007. Springer, Berlin
12. Baruah S, Bonifaci V, Marchetti-Spaccamela A, Stiller S (2009) Implementation of a speedup-optimal global EDF schedulability test. In: Proceedings of the EuroMicro conference on real-time systems, Dublin, July 2009. IEEE Computer Society Press, Los Alamitos
13. Bertogna M (2008) Real-time scheduling analysis for multiprocessor platforms. PhD thesis, Scuola Superiore Santa Anna, Pisa, Italy
14. Bertogna M (2009) Evaluation of existing schedulability tests for global edf. In: ICPPW '09: Proceedings of the 2009 international conference on parallel processing workshops, Washington, DC, USA, 2009. IEEE Computer Society, Los Alamitos, pp 11-18
15. Bertogna M, Cirinei M (2007) Response-time analysis for globally scheduled symmetric multiprocssor platforms. In: Proceedings of the real-time systems symposium, Tucson, AZ, December 2007. IEEE Computer Society Press, Los Alamitos, pp 149-158
16. Bertogna M, Cirinei M, Lipari G (2005) Improved schedulability analysis of EDF on multiprocessor platforms. In: Proceedings of the EuroMicro conference on real-time systems, Palma de Mallorca, Balearic Islands, Spain, July 2005. IEEE Computer Society Press, Los Alamitos, pp 209-218
17. Bonifaci V, Marchetti-Spaccamela A, Stiller S (2008) A constant-approximate feasibility test for multiprocessor real-time scheduling. In: Proceedings of the 16th annual European symposium on algorithms, Karlsruhe, Germany, 2008, pp 210-221
18. Dertouzos M (1974) Control robotics: the procedural control of physical processors. In: Proceedings of the IFIP congress, pp 807-813
19. Eisenbrand F, RothvoT (2010) EDF-schedulability of synchronous periodic task systems is coNP-hard. In: Proceedings of the annual ACM-SIAM symposium on discrete algorithms, January 2010
20. Fisher N, Baruah S (2006) Global static-priority scheduling of sporadic task systems on multiprocessor platforms. In: Proceeding of the IASTED international conference on parallel and distributed computing and systems, Dallas, TX, November 2006. IASTED
21. Leontyev H, Anderson J (2008) A unified hard/soft real-time schedulability test for global EDF multiprocessor scheduling. In: Proceedings of the real-time systems symposium, Barcelona, December 2008. IEEE Computer Society Press, Los Alamitos
22. J Leung J Whitehead 1982 On the complexity of fixed-priority scheduling of periodic, real-time tasks Perform Eval 2 237 250 0496.90046 10.1016/0166-5316(82)90024-4 695235 (Pubitemid 13487696)
23. C Liu J Layland 1973 Scheduling algorithms for multiprogramming in a hard real-time environment J ACM 20 1 46 61 0265.68013 10.1145/321738.321743 343898
24. Phillips CA, Stein C, Torng E, Wein J (1997) Optimal time-critical scheduling via resource augmentation. In: Proceedings of the twenty-ninth annual ACM symposium on theory of computing, El Paso, Texas, 4-6 May 1997, pp 140-149