Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible

Real-Time Systems

Volumn 45, Issue 1-2, 2010, Pages 26-71

  Fisher, Nathan ^a   Goossens, Joël ^b   Baruah, Sanjoy ^c  

^a WAYNE STATE UNIVERSITY   (United States)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Multiprocessor systems; Optimal scheduling algorithms; Real time scheduling; Sporadic task model

Indexed keywords

DETERMINISTIC SCHEDULING; MULTI PROCESSOR SCHEDULING; MULTI PROCESSOR SYSTEMS; MULTI-PROCESSOR PLATFORMS; ONLINE SCHEDULING; ONLINE SCHEDULING ALGORITHM; OPTIMAL SCHEDULING ALGORITHM; REAL TIME SCHEDULING; REAL-TIME TASKS; SINGLE PROCESSORS; SPORADIC TASK SYSTEMS; TASK MODELS;

MULTIPROCESSING SYSTEMS; ONLINE SYSTEMS; OPTIMIZATION; REAL TIME SYSTEMS;

SCHEDULING ALGORITHMS;

EID: 77955922215     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11241-010-9092-7     Document Type: Article

References (23)

1. Audsley NC, Burns A, Richardson MF, Wellings AJ (1991) Hard real-time scheduling: the deadline monotonic approach. In: Proceedings 8th IEEE workshop on real-time operating systems and software, Atlanta, May 1991, pp 127-132
2. 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, Los Alamitos, pp 178-187
3. 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
4. Baruah S (2003) Dynamic-and static-priority scheduling of recurring real-time tasks. Real-Time Syst 24 (1):99-128
5. 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
6. Baruah S, Howell R, Rosier L (1993) Feasibility problems for recurring tasks on one processor. Theor Comput Sci 118 (1):3-20
7. Baruah S, Cohen N, Plaxton G, Varvel D (1996) Proportionate progress: a notion of fairness in resource allocation. Algorithmica 15 (6):600-625
8. Baruah S, Chen D, Gorinsky S, Mok A (1999) Generalized multiframe tasks. Real-Time Syst 17 (1):5-22
9. Birman K, Joseph T (1987) Exploiting virtual synchrony in distributed systems. SIGOPS Oper Syst Rev 21 (5):123-138
10. Dertouzos M (1974) Control robotics: the procedural control of physical processors. In: Proceedings of the IFIP congress, pp 807-813
11. Dertouzos M, Mok AK (1989) Multiprocessor scheduling in a hard real-time environment. IEEE Trans Softw Eng 15 (12):1497-1506
12. Dhall SK, Liu CL (1978) On a real-time scheduling problem. Oper Res 26:127-140
13. Fischer MJ, Lynch NA, Paterson MS (1985) Impossibility of distributed consensus with one faulty process. J ACM 32 (2):374-382
14. Fisher N, Baruah S (2009) The feasibility of general task systems with precedence constraints on multiprocessor platforms. Real-Time Syst 41 (1):1-26
15. Hong K, Leung J (1988) On-line scheduling of real-time tasks. In: Proceedings of the real-time systems symposium, Huntsville, AL, December 1988. IEEE, New York, pp 244-250
16. Horn W (1974) Some simple scheduling algorithms. Nav Res Logist Q 21:177-185
17. Jeffay K, Stanat D, Martel C (1991) On non-preemptive scheduling of periodic and sporadic tasks. In: Proceedings of the 12th real-time systems symposium, San Antonio, TX, December 1991. IEEE Computer Society, Los Alamitos, pp 129-139
18. Kolmogorov AN, Fomin SV (1970) Introductory real analysis. Dover, New York
19. Leung J, Whitehead J (1982) On the complexity of fixed-priority scheduling of periodic, real-time tasks. Perform Eval 2:237-250
20. Liu C, Layland J (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. J ACM 20 (1):46-61
21. Mok AK (1983) Fundamental design problems of distributed systems for the hard-real-time environment. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology. Available as Technical Report No. MIT/LCS/TR-297
22. 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, TX, 4-6 May 1997, pp 140-149
23. Srinivasan A, Anderson J (2002) Optimal rate-based scheduling on multiprocessors. In: Proceedings of the 34th ACM symposium on the theory of computing, May 2002, pp 189-198