An optimal boundary fair scheduling algorithm for multiprocessor real-time systems

Journal of Parallel and Distributed Computing

Volumn 71, Issue 10, 2011, Pages 1411-1425

  Zhu, Dakai ^a   Qi, Xuan ^a   Mossé, Daniel ^b   Melhem, Rami ^b  

^a UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

^b UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

Boundary fairness (Bfair) scheduling; Multiprocessor; Optimal scheduling algorithms; Periodic tasks; Real time systems

Indexed keywords

BOUNDARY FAIRNESS (BFAIR) SCHEDULING; CONTEXT SWITCH; EXTENSIVE SIMULATIONS; FAIR SCHEDULING ALGORITHM; MULTI-CORE PROCESSOR; MULTIPROCESSOR; OPEN PROBLEMS; OPTIMAL BOUNDARY; OPTIMAL SCHEDULING ALGORITHM; PERIODIC TASKS; REAL TIME SCHEDULING; REAL-TIME TASKS; RESEARCH FIELDS; RUNTIMES; SCHEDULING DECISIONS; SYSTEM UTILIZATION; TASK MIGRATION; TIME ALLOCATION; TIME INTERVAL; TIME UNITS;

COST REDUCTION; MULTIPROCESSING SYSTEMS; OPTIMIZATION; REAL TIME SYSTEMS; RESEARCH; TIME SWITCHES;

SCHEDULING ALGORITHMS;

EID: 80051664491     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2011.06.003     Document Type: Article

References (46)

1. J.H. Anderson, A. Srinivasan, Early-release fair scheduling, in: Proc. of the 12th Euromicro Conference on Real-Time Systems, Jun. 2000, pp. 3543.
2. J.H. Anderson, A. Srinivasan, Pfair scheduling: Beyond periodic task systems, in: Proc. of the 7th Int'l Workshop on Real-Time Computing Systems and Applications, Dec. 2000, pp. 297306.
3. J.H. Anderson, A. Srinivasan, Mixed pfair/erfair scheduling of asynchronous periodic tasks, in: Proc. of the 13th Euromicro Conference on Real-Time Systems, Jun. 2001, pp. 7685.
4. B. Andersson, S. Baruah, J. Jonsson, Static-priority scheduling on multiprocessors, in: Proc. of the 22th IEEE Real-Time Systems Symposium, Dec. 2001, pp. 193202. (Pubitemid 34068990)
5. B. Andersson, K. Bletsas, S. Baruah, Scheduling arbitrary-deadline sporadic task systems on on multiprocessors, in: Proceedings of the 2008 IEEE Real-Time Systems Symposium, 2008, pp. 385394.
6. B. Andersson, J. Jonsson, The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%, in: Proc. of the 15th Euromicro Conference on Real-Time Systems, 2003, pp. 3340.
7. B. Andersson, E. Tovar, Multiprocessor scheduling with few preemptions, in: Proc. of the IEEE Int'l Conference on Embedded and Real-Time Computing Systems and Applications, Sept. 2006, pp. 322334.
8. T.P. Baker, Multiprocessor edf and deadline monotonic schedulability analysis, in: Proc. of The 24th IEEE Real-Time Systems Symposium, Dec. 2003, pp. 120129.
9. S. Baruah, Techniques for multiprocessor global schedulability analysis, in: Proc. of the IEEE Real-Time Systems Symposium, Dec. 2007, pp. 119128.
10. S. Baruah, and T. Baker Schedulability analysis of global edf Real-Time Syst. 38 3 2008 223 235
11. S. Baruah, N. Fisher, Component-based design in multiprocessor real-time systems, in: Proceedings of the 6th IEEE International Conference on Embedded Systems and Software, May 2009, pp. 209214.
12. S.K. Baruah, N.K. Cohen, C.G. Plaxton, and D.A. Varel Proportionate progress: a notion of fairness in resource allocation Algorithmica 15 6 1996 600 625 (Pubitemid 126422534)
13. S.K. Baruah, J. Gehrke, C.G. Plaxton, Fast scheduling of periodic tasks on multiple resources, in: Proc. of The International Parallel Processing Symposium, Apr. 1995, pp. 280288.
14. M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, and R.E. Tarjan Time bounds for selection J. Comput. System Sci. 7 1973 448 461
15. H. Cho, B. Ravindran, E.D. Jensen, An optimal real-time scheduling algorithm for multiprocessors, in: Proc. of the IEEE Real-Time Systems Symposium, Dec. 2006, pp. 101110. (Pubitemid 351209722)
16. H. Cho, B. Ravindran, and E.D. Jensen T L plane-based real-time scheduling for homogeneous multiprocessors J. Parallel Distrib. Comput. 70 3 2010 225 236
17. V.N. Darera, Bounds for scheduling in non-identical uniform multiprocessor systems. Master's thesis, Indian Institute of Science, India, 2006.
18. R.I. Davis, A. Burns, A survey of hard real-time scheduling algorithms and schedulability analysis techniques for multiprocessor systems. Technical Report YCS-2009-443, University of York, Department of Computer Science, 2009.
19. M.L. Dertouzos, and A.K. Mok Multiprocessor on-line scheduling of hard-real-time tasks IEEE Trans. Softw. Eng. 15 12 1989 1497 1505
20. U.C. Devi, J.H. Anderson, Tardiness bounds under global edf scheduling on a multiprocessor, in: Proc. of the 26th IEEE Real-Time Systems Symposium, Dec. 2005, pp. 330341.
21. S.K. Dhall, and C.L. Liu On a real-time scheduling problem Oper. Res. 26 1 1978 127 140
22. N. Fisher, J. Goossens, and S. Baruah Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible Real-Time Syst. 45 Jun. 2010 26 71
23. K. Funaoka, S. Kato, N. Yamasaki, Work-conserving optimal real-time scheduling on multiprocessors, in: Proc. of the 20th Euromicro Conference on Real-Time Systems, Jul. 2008, pp. 1322.
24. S. Funk, V. Nelis, J. Goossens, D. Milojevic, G. Nelissen, On the design of an optimal multiprocessor real-time scheduling algorithm under practical considerations (extended version). Technical Report http://arxiv.org/abs/1001. 4115, Jan 2010.
25. J. Goossens, S. Funk, and S. Baruah Priority-driven scheduling of periodic task systems on multiprocessors Real-Time Syst. 25 23 2003 187 205
26. N. Guan, M. Stigge, W. Yi, G. Yu, Fixed-priority multiprocessor scheduling with liu and layland's utilization bound, in: Proc. of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, Apr. 2010, pp. 165174.
27. N. Guan, W. Yi, Z. Gu, Q. Deng, G. Yu, New schedulability test conditions for non-preemptive scheduling on multiprocessor platforms, in: Proc. of the 2008 IEEE Real-Time Systems Symposium, Dec. 2008, pp. 137146.
28. P. Holman, J.H. Anderson, Guaranteeing pfair supertasks by reweighting, in: Proc. of the 22nd IEEE Real-Time Systems Symposium, Dec. 2001, pp. 203212. (Pubitemid 34064494)
29. J. Jun, M.L. Sichitiu, Fairness and qos in multihop wireless networks, in: Proc. of the IEEE 58th Vehicular Technology Conference, 2003, pp. 29362940.
30. S. Kato, K. Funaoka, N. Yamasaki, Semi-partitioned scheduling of sporadic task systems on multiprocessors, in: Proc. of the 21th Euromicro Conference on Real-Time Systems, Jul. 2009, pp. 249258.
31. S. Kato, N. Yamasaki, Real-time scheduling with task splitting on multiprocessors, in: Proc. of the IEEE In'l Conference on Embedded and Real-Time Computing Systems and Applications, Aug. 2007, pp. 441450.
32. S. Kato, N. Yamasaki, Portioned edf-based scheduling on multiprocessors, in: Proc. of the 8th ACM international conference on Embedded software, Oct. 2008, pp. 139148.
33. S. Kato, N. Yamasaki, Semi-partitioned fixed-priority scheduling on multiprocessors, in: Proc. of the 15th IEEE Symposium on Real-Time and Embedded Technology and Applications, 2009, pp. 2332.
34. G. Levin, S. Funk, C. Sadowski, I. Pye, S. Brandt, Dp-fair: a simple model for understanding optimal multiprocessor scheduling, in: Proc. of the Euromicro Conference on Real-Time Systems, Jul. 2010, pp. 313.
35. C.L. Liu, and James W. Layland Scheduling algorithms for multiprogramming in a hard real-time environment J. ACM 20 1 1973 46 61
36. D. Liu, Y.-H. Lee, Pfair scheduling of periodic tasks with allocation constraints on multiple processors, in: Proc. of the 18th Int'l Parallel and Distributed Processing Symposium, Apr. 2004, pp. 119126.
37. J.M. Lopez, J.L. Diaz, D.F. Garcia, Minimum and maximum utilization bounds for multiprocessor rm scheduling, in: The Proc. of the 13th Euromicro Conference on Real-Time Systems, Jun. 2001, pp. 6775.
38. J.M. Lopez, M. Garcia, J.L. Diaz, D.F. Garcia, Worst-case utilization bound for edf scheduling on real-time multiprocessor systems, in: The Proc. of the 12th Euromicro Conference on Real-Time Systems, Jun. 2000, pp. 2533.
39. R. McNaughton Scheduling with deadlines and loss functions Manage. Sci. 6 1959 1 12
40. M. Moir, S. Ramamurthy, Pfair scheduling of fixed and migrating tasks on multiple resources, in: Proc. of the 20th IEEE Real-Time Systems Symposium, Dec. 1999, pp. 294303. (Pubitemid 30560569)
41. D.I. Oh, and T.P. Baker Utilization bound for n-processor rate monotone scheduling with stable processor assignment Real-Time Syst. 15 2 1998 183 193
42. L. Sha, T. Abdelzaher, K.-E. Arzén, A. Cervin, T. Baker, A. Burns, G. Buttazzo, M. Caccamo, J. Lehoczky, and A.K. Mok Real time scheduling theory: a historical perspective Real-Time Syst. 28 23 2004 101 155
43. I. Shin, A. Easwaran, I. Lee, Hierarchical scheduling framework for virtual clustering of multiprocessors, in: Proc. of the 20th Euromicro Conference on Real-Time Systems, Jul. 2008, pp. 181190.
44. A. Srinivasan, and J.H. Anderson Optimal rate-based scheduling on multiprocessors J. Comput. Syst. Sci. 72 Sept. 2006 1094 1117 (Pubitemid 44163574)
45. D. Zhu, D. Mossé, R. Melhem, Periodic multiple resource scheduling problem: how much fairness is necessary, in: Proc. of The 24th IEEE Real-Time Systems Symposium, Dec. 2003, pp. 142151.
46. D. Zhu, X. Qi, D. Mossé, R. Melhem, An optimal boundary-fair scheduling algorithm for multiprocessor real-time systems. Technical Report CS-TR-2009-005, Dept. of Computer Science, Univ. of Texas at San Antonio, Jun. 2009.