An EDF-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems

Real-Time Systems

Volumn 38, Issue 2, 2008, Pages 85-131

  Anderson, James H ^a   Bud, Vasile ^a   Devi, UmaMaheswari C ^a  

^a CB 3175 Sitterson Hall   (United States)

Author keywords

Earliest deadline first; Global scheduling; Migrations; Multiprocessors; Partitioning; Scheduling; Soft real time; Tardiness

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; MULTIPROCESSING SYSTEMS; REAL TIME SYSTEMS;

EARLIEST-DEADLINE-FIRST; GLOBAL SCHEDULING; PARTITIONING; SOFT REAL-TIME;

SCHEDULING;

EID: 38749117531     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11241-007-9035-0     Document Type: Article

References (40)

1. Abeni L, Buttazzo G (1998) Integrating multimedia applications in hard real-time systems. In: Proceedings of the 19th IEEE real-time systems symposium, December 1998, pp 4-13
2. Abeni L, Buttazzo G (1999) QoS guarantees using probabilistic deadlines. In: Proceedings of the 11th Euromicro conference of real-time systems, June 1999, pp 242-249
3. Andersson B, Jonsson J (2003) The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%. In: Proceedings of the 15th Euromicro conference on real-time systems, July 2003, pp 33-40
4. Andersson B, Baruah S, Jonsson J (2001) Static priority scheduling on multiprocessors. In: Proceedings of the 22nd real-time systems symposium, December 2001, pp 193-202
5. Anderson J, Bud V, Devi U (2005) An EDF-based scheduling algorithm for multiprocessor soft real-time systems. In: Proceedings of the 17th Euromicro conference on real-time systems, July 2005, pp 199-208
6. Atlas A, Bestavros A (1998) Statistical rate monotonic scheduling. In: Proceedings of the 19th IEEE real-time systems symposium, December 1998, pp 123-132
7. Aydin H, Melhem R, Mosse D, Alvarez PM (2001) Optimal reward-based scheduling for periodic real-time tasks. IEEE Trans Comput 50(2):111-130
8. Baker TP (2003) Multiprocessor EDF and deadline monotonic schedulability analysis. In: Proceedings of the 24th IEEE real-time systems symposium, December 2003, pp 120-129
9. Baruah S (2004) Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors. IEEE Trans Comput 53(6):781-784
10. Baruah S, Carpenter J (2003) Multiprocessor fixed-priority scheduling with restricted inter-processor migrations. In: Proceedings of the 15th Euromicro conference on real-time systems, July 2003, pp 195-202
11. Baruah S, Cohen N, Plaxton CG, Varvel D (1996) Proportionate progress: a notion of fairness in resource allocation. Algorithmica 15(6):600-625
12. Bernat G, Burns A, Liamosi A (2001) Weakly hard real-time systems. IEEE Trans Comput 50(4):308-321
13. Carpenter J, Funk S, Holman P, Srinivasan A, Anderson J, Baruah S (2004) A categorization of real-time multiprocessor scheduling problems and algorithms. In: Leung JY (ed) Handbook on scheduling algorithms, methods, and models. Chapman Hall/CRC, Boca Raton, pp 30.1-30.19
14. Coffman EG, Denning PJ (1973) Operating systems theory. Prentice Hall Professional Technical Reference
15. Devi U, Anderson J (2004) Improved conditions for bounded tardiness under EPDF fair multiprocessor scheduling. In: Proceedings of the 12th international workshop on parallel and distributed real-time systems, April 2004 (on CD-ROM)
16. Devi U, Anderson J (2005) Tardiness bounds under global EDF scheduling on a multiprocessor. In: Proceedings of the 26th IEEE real-time systems symposium, December 2005, pp 330-341
17. Diaz JL, Garcia DF, Kim K, Lee C-G, Bello L, Lopez JM, Min SL, Mirabella O (2002) Stochastic analysis of periodic real-time systems. In: Proceedings of the 23rd IEEE real-time systems symposium, December 2002, pp 289-300
18. Doytchinov B, Lehoczky J, Shreve S (2001) Real-time queues in heavy traffic with earliest-deadline-first queue discipline. Ann Appl Probab 11(2):332-378
19. Goossens J, Funk S, Baruah S (2003) Priority-driven scheduling of periodic task systems on multiprocessors. Real-Time Syst 25(2-3):187-205
20. Hamdaoui M, Ramanathan P (1995) A dynamic priority assignment technique for streams with (m,k)-firm deadlines. IEEE Trans Comput 44(12):1443-1451
21. Jensen ED, Locke CD, Tokuda H (1985) A time driven scheduling model for real-time operating systems. In: Proceedings of the 6th IEEE Real-time systems symposium, pp 112-122
22. Khemka A, Shyamasundar RK (1992) Multiprocessor scheduling of periodic tasks in a hard real-time environment. In: Proceedings of the 6th international parallel processing symposium, March 1992, pp 76-81
23. Koren G, Shasha D (1995) Skip-over: Algorithms and complexity for overloaded systems that allow skips. In: Proceedings of the 16th IEEE real-time systems symposium, December 1995, pp 110-117
24. Kurk L, Lehoczky J, Shreve S, Yeung S-N (2004) Earliest-deadline-first service in heavy-traffic acyclic networks. Ann Appl Probab 14(3):1306-1352
25. Lehoczky J (1990) Fixed priority scheduling of periodic task sets with arbitrary deadlines. In: Proceedings of the 11st IEEE real-time systems symposium, December 1990, pp 201-209
26. Lehoczky JP (1996) Real-time queuing theory. In: Proceedings of the 17th IEEE real-time systems symposium, December 1996, pp 186-195
27. Lehoczky JP, Sha L, Ding Y (1989) Rate-monotonic scheduling algorithm: Exact characterization and average case behavior. In: Proceedings of the 11th IEEE real-time systems symposium, December 1989, pp 166-171
28. Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. Assoc Comput Mach 20(1):46-61
29. Liu JWS, Lin K-J, Shih W-K, Yu AC (1991) Algorithms for scheduling imprecise computations. IEEE Comput 24(5):58-68
30. Lopez JM, Garcia M, Diaz JL, Garcia DF (2000) Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems. In: Proceedings of the 12th Euromicro conference on real-time systems, June 2000, pp 25-34
31. Lopez JM, Diaz JL, Garcia DF (2004) Utilization bounds for EDF scheduling on real-time multiprocessor systems. Real-Time Syst 28(1):39-68
32. Mok A (1983) Fundamental design problems of distributed systems for hard real-time environments. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA
33. Sha L, Goodenough J (1990) Real-time scheduling theory and Ada. IEEE Comput 23(4):53-62
34. Sha L, Abdelzaher T, Arzen K-E, Cervin A, Baker T, Burns A, Buttazzo G, Caccamo M, Lehoczky J, Mok AK (2004) Real time scheduling theory: A historical perspective. Real-Time Syst 28(2/3):101-155
35. Spuri M (1996) Analysis of deadline scheduled real-time systems. Technical Report 2772, Institut National de Recherche en Informatique et en Automatique
36. Srinivasan A, Anderson J (2002) Optimal rate-based scheduling on multiprocessors. In: Proceedings of the 34th ACM symposium on theory of computing, May 2002, pp 189-198
37. Srinivasan A, Anderson J (2003) Efficient scheduling of soft real-time applications on multiprocessors. In: Proceedings of the 15th Euromicro conference on real-time systems, July 2003, pp 51-59
38. Tia T-S, Deng D-Z, Shankar M, Storch M, Sun J, Wu L-C, Liu J-S (1995) Probabilistic performance guarantee for real-time tasks with varying computation times. In: Proceedings of the 2nd IEEE real-time and embedded technology and applications symposium, May 1995, pp 164-173
39. Valente P, Lipari G (2005) An upper bound to the lateness of soft real-time tasks scheduled by EDF on multiprocessors. In: Proceedings of the 26th IEEE real-time systems symposium, December 2005, pp 311-320
40. West R, Poellabauer C (2000) Analysis of a window-constrained scheduler for real-time and best-effort packet streams. In: Proceedings of the 21st IEEE real-time systems symposium, December 2000, pp 239-248