Jump to ContentJump to Main Navigation
Show Summary Details
In This Section

Open Computer Science

Editor-in-Chief: van den Broek, Egon

1 Issue per year

Open Access
Online
ISSN
2299-1093
See all formats and pricing
In This Section

Genealogy of hard real-time preemptive scheduling algorithms for identical multiprocessors

Dirk Müller
  • Chemnitz University of Technology, Str. der Nationen 62, D-09111, Chemnitz, Germany
  • Email:
/ Matthias Werner
  • Chemnitz University of Technology, Str. der Nationen 62, D-09111, Chemnitz, Germany
  • Email:
Published Online: 2011-09-28 | DOI: https://doi.org/10.2478/s13537-011-0023-z

Abstract

With the advent of multi-core computer systems, real-time (RT) scheduling on multiprocessors (MPs) is gaining more and more practical relevance. Basic algorithms developed in the 1970s or earlier are strongly influential on state-of-the-art preemptive hard real-time scheduling algorithms. These relationships will be revealed and visualized by four genealogies. Here, the two classification dimensions prioritization dynamics and migration dynamics serve as a framework for the systematization. Finally, such genealogical reconstructions could even lead to the discovery of new algorithms. An extra look will be devoted to the group of fully dynamic scheduling algorithms with full migration in which algorithms can reach full utilization, neglecting scheduling and context switching overheads. The important question for a set of RT scheduling algorithms serving as a basis for more sophisticated ones will be dealt with.

Keywords: multiprocessor; scheduling; migration dynamics; prioritization

  • [1] Amdahl G.M., Validity of the single processor approach to achieving large scale computing capabilities. In: AFIPS’ 67 (Spring), Proceedings of the April 18–20, 1967, spring joint computer conference, pp. 483–485. ACM, New York, NY, USA, 1967 http://dx.doi.org/10.1145/1465482.1465560 [Crossref]

  • [2] Anderson J.H., Bud V., Devi U.C., An EDF-based scheduling algorithm for multiprocessor soft real-time systems. In: ECRTS’ 05, Proceedings of the 17th Euromicro Conference on Real-Time Systems, pp. 199–208. IEEE Computer Society, Washington, DC, USA, 2005 http://dx.doi.org/10.1109/ECRTS.2005.6 [Crossref]

  • [3] Andersson B., Static-priority scheduling on multiprocessors. Ph.D. thesis, Chalmers University of Technology, 2003

  • [4] Andersson B., Global static-priority preemptive multiprocessor scheduling with utilization bound 38%. In: OPODIS’ 08, Proceedings of the 12th International Conference on Principles of Distributed Systems, 73–88. Springer-Verlag, Berlin, Heidelberg, 2008

  • [5] Andersson B., The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50%. In: SAC’ 08, Proceedings of the 2008 ACM symposium on Applied computing, 281–283, ACM, New York, NY, USA, 2008 http://dx.doi.org/10.1145/1363686.1363760 [Crossref]

  • [6] Andersson B., Baruah S., Jonsson J., Static-priority scheduling on multiprocessors. In: RTSS’ 01, Proceedings of the 22nd IEEE Real-Time Systems Symposium, 93, IEEE Computer Society, Washington, DC, USA, 2001

  • [7] Andersson B., Tovar E., Multiprocessor scheduling with few preemptions. In: RTCSA’ 06, Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, 322–334, IEEE Computer Society, Sydney, Australia, 2006 http://dx.doi.org/10.1109/RTCSA.2006.45 [Crossref]

  • [8] Audsley N., Burns A., Richardson M., Tindell K., Wellings A., Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal 8(5), 284–292 (1993) http://dx.doi.org/10.1049/sej.1993.0034 [Crossref]

  • [9] Baker T.P., An analysis of EDF schedulability on a multiprocessor. IEEE Transactions on Parallel and Distributed Systems, 2005, 16, 760–768 http://dx.doi.org/10.1109/TPDS.2005.88 [Crossref]

  • [10] Baker T.P., Baruah S.K., Sustainable multiprocessor scheduling of sporadic task systems. In: ECRTS, pp. 141–150. IEEE Computer Society, 2009

  • [11] Baker T.P., Cirinei M., Bertogna M., EDZL scheduling analysis. Real-Time Syst., 2008, 40(3), 264–289 http://dx.doi.org/10.1007/s11241-008-9061-6 [Crossref]

  • [12] Baruah S., Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors. Computers, IEEE Transactions on, 2004, 53(6), 781–784 http://dx.doi.org/10.1109/TC.2004.16 [Crossref]

  • [13] Baruah S.K., Carpenter J., Multiprocessor fixed-priority scheduling with restricted interprocessor migrations. In: ECRTS, 195–202, IEEE Computer Society, 2003

  • [14] Baruah S.K., Cohen N.K., Plaxton C.G., Varvel D.A., Proportionate progress, A notion of fairness in resource allocation. Algorithmica, 1996, 15(6), 600–625 http://dx.doi.org/10.1007/BF01940883 [Crossref]

  • [15] Bastoni A., Brandenburg B.B., Anderson J.H., An empirical comparison of global, partitioned, and clustered multiprocessor EDF schedulers. In: RTSS, 14–24, IEEE Computer Society, 2010

  • [16] Bastoni A., Brandenburg B.B., Anderson J.H., Is semi-partitioned scheduling practical? Real-Time Systems, Euromicro Conference, 125–135, 2011

  • [17] Bertogna M., Cirinei M., Lipari G., New schedulability tests for real-time task sets scheduled by deadline monotonic on multiprocessors. In: J.H. Anderson, G. Prencipe, R. Wattenhofer (Eds.) OPODIS, Lecture Notes in Computer Science, Vol. 3974, 306–321. Springer, 2005

  • [18] Bletsas K., Andersson B., Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound. In: Proceedings of the 2009 30th IEEE Real-Time Systems Symposium, RTSS’ 09, 447–456, IEEE Computer Society, Washington, DC, USA, 2009 http://dx.doi.org/10.1109/RTSS.2009.16 [Crossref]

  • [19] Buttazzo G.C., Hard real-time computing systems, predictable scheduling algorithms and applications. Kluwer Academic Publishers, 1997

  • [20] Buttazzo G.C., Rate monotonic vs. EDF, judgment day. Real-Time Syst., 2005, 29, 5–26, http://dl.acm.org/citation.cfm?id=1035387.1035388 http://dx.doi.org/10.1023/B:TIME.0000048932.30002.d9 [Crossref]

  • [21] Carpenter J., Funk S., Holman P., Anderson J., Baruah S., A categorization of real-time multiprocessor scheduling problems and algorithms. In: Handbook on Scheduling Algorithms, Methods, and Models, pp. 30-1–30-19. Chapman Hall/CRC, Boca, 2004

  • [22] Chang Y., Davis R., Wellings A., Schedulability analysis for a real-time multiprocessor system based on service contracts and resource partitioning. Tech. rep., University of York, 2008, http://www.cs.york.ac.uk/ftpdir/reports/2008/YCS/432/YCS-2008-432.pdf

  • [23] Cho H., Ravindran B., Jensen E.D., An optimal real-time scheduling algorithm for multiprocessors. Real-Time Systems Symposium, IEEE International, 101–110, 2006

  • [24] Cirinei M., Exploiting the power of multiprocessors for real-time systems. Ph.D. thesis, Scuola Superiore S Anna, 2007

  • [25] Damm A., Reisinger J., Schwabl W., Kopetz H., The real-time operating system of MARS. Operating Systems Review, 1989, 23(3), 141–157 http://dx.doi.org/10.1145/71021.71029 [Crossref]

  • [26] Davis R., Burns A., FPZL schedulability analysis. techreport YCS-2010-452, University of York, Department of Computer Science, 2010

  • [27] Davis R.I., Burns A., Priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. In: T.P. Baker (Ed.) IEEE Real-Time Systems Symposium, 398–409, IEEE Computer Society, Washington, DC, USA, 2009

  • [28] Davis R.I., Burns A., A survey of hard real-time scheduling for multiprocessor systems. ACM Computing Surveys, 2011, 43(4) [Crossref]

  • [29] Dertouzos M.L., Mok A.K., Multiprocessor online scheduling of hard-real-time tasks. IEEE Trans. Softw. Eng., 1989, 15(12), 1497–1506 http://dx.doi.org/10.1109/32.58762 [Crossref]

  • [30] Devillers R., Goossens J., Liu and Layland’s schedulability test revisited. Information Processing Letters, 2000, 73(5–6), 157–161 http://dx.doi.org/10.1016/S0020-0190(00)00016-8 [Crossref]

  • [31] Dhall S.K., Liu C., On a real-time scheduling problem. Operations Research, 1978, 26(1), 127–140 http://dx.doi.org/10.1287/opre.26.1.127 [Crossref]

  • [32] Dong J., Zhang Y., A modified rate-monotonic algorithm for scheduling periodic tasks with different importance in embedded system. In: ICEMI 2009 — Proc. of 9th International Conference on Electronic Measurement and Instruments, pp. 4606–4609 (2009)

  • [33] Easwaran A., Shin I., Lee I., Optimal virtual cluster-based multiprocessor scheduling. Real-Time Syst., 2009, 43(1), 25–59 http://dx.doi.org/10.1007/s11241-009-9073-x [Crossref]

  • [34] Funk S., Baruah S., Restricting EDF migration on uniform multiprocessors. In: Proceedings of the 12th International Conference on Real-Time Systems, 2004

  • [35] Funk S., Levin G., Sadowski C., Pye I., Brandt S., DP-Fair, a unifying theory for optimal hard real-time multiprocessor scheduling. Real-Time Systems, 2011, 47(5), 389–429 http://dx.doi.org/10.1007/s11241-011-9130-0 [Crossref]

  • [36] Funk S.H., Nadadur V., LRE-TL, An optimal multiprocessor scheduling algorithm for sporadic task sets. In: Proceedings of the 17th Real-Time and Network Systems (RTNS), 2009, 159–168

  • [37] Goossens J., Funk S., Baruah S., Priority-driven scheduling of periodic task systems on multiprocessors. Real-Time Syst., 2003, 25, 187–205 http://dx.doi.org/10.1023/A:1025120124771 [Crossref]

  • [38] Guan N., Stigge M., Yi W., Yu G., Fixed-priority multiprocessor scheduling with liu and layland’s utilization bound. In: RTAS’ 10, Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium, 165–174, IEEE Computer Society, Washington, DC, USA, 2010 http://dx.doi.org/10.1109/RTAS.2010.39 [Crossref]

  • [39] Holman P., Anderson J.H., Adapting pfair scheduling for symmetric multiprocessors. J. Embedded Comput., 2005, 1(4), 543–564

  • [40] Jung M.J., Seong Y.R., Lee C.H., Optimal rm scheduling for simply periodic tasks on uniform multiprocessors. In: ICHIT’ 09, Proceedings of the 2009 International Conference on Hybrid Information Technology, 383–389, ACM, New York, NY, USA, 2009 http://dx.doi.org/10.1145/1644993.1645064 [Crossref]

  • [41] Kato S., Yamasaki N., Real-time scheduling with task splitting on multiprocessors. In: RTCSA’ 07, Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, 441–450, IEEE Computer Society, Washington, DC, USA, 2007

  • [42] Kato S., Yamasaki N., Global EDF-based scheduling with efficient priority promotion. In: RTCSA’ 08, Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, 197–206, IEEE Computer Society, Kaohsiung, Taiwan, 2008 http://dx.doi.org/10.1109/RTCSA.2008.11 [Crossref]

  • [43] Kato S., Yamasaki N., Portioned EDF-based scheduling on multiprocessors. In: EMSOFT’ 08, Proceedings of the 8th ACM international conference on Embedded software, 139–148, ACM, New York, NY, USA, 2008 http://dx.doi.org/10.1145/1450058.1450078 [Crossref]

  • [44] Kato S., Yamasaki N., Portioned static-priority scheduling on multiprocessors. In: IPDPS, 1–12, IEEE, 2008

  • [45] Kato S., Yamasaki N., Real-time scheduling module for linux kernel. In: IPSJ Transactions on Advanced Computing Systems, 2009, Vol. 2, 75–86

  • [46] Kato S., Yamasaki N., Semi-partitioned fixed-priority scheduling on multiprocessors. In: RTAS’ 09, Proceedings of the 2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium, 23–32, IEEE Computer Society, Washington, DC, USA, 2009 http://dx.doi.org/10.1109/RTAS.2009.9 [Crossref]

  • [47] Kato S., Yamasaki N., Ishikawa Y., Semi-partitioned scheduling of sporadic task systems on multiprocessors. In: ECRTS’ 09, Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems, 249–258, IEEE Computer Society, Dublin, Ireland, 2009

  • [48] Kopetz H., Damm A., Koza C., Mulazzani M., Schwabl W., Senft C., Zainlinger R.: Distributed fault-tolerant real-time systems, The Mars Approach. IEEE Micro, 1989, 9(1), 25–40 http://dx.doi.org/10.1109/40.16792 [Crossref]

  • [49] Krämer S., Mottok J., Meier H., Anpassung des LLREF-Algorithmus: Multi-Core-Scheduling in Embedded Systemen (in German). Hanser automotive, 2010, 1/2; 3/4; 5/6, 18–22; 23–25; 14–16, http://www.hanser-automotive.de/fileadmin/heftarchiv/2004/31567.pdf

  • [50] Lakshmanan K., Rajkumar R., Lehoczky J., Partitioned fixed-priority preemptive scheduling for multi-core processors. In: ECRTS’ 09, Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems, 239–248, IEEE Computer Society, Washington, DC, USA, 2009

  • [51] Leung J.Y.T., Whitehead J., On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation, 1982, 2(4), 237–250 http://dx.doi.org/10.1016/0166-5316(82)90024-4 [Crossref]

  • [52] Liu C.L., Layland J.W., Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM, 1973, 20(1), 46–61 http://dx.doi.org/10.1145/321738.321743 [Crossref]

  • [53] López J.M., García M., Díaz J.L., García D.F., Utilization bounds for multiprocessor rate-monotonic scheduling. Real-Time Syst., 2003, 24, 5–28, http://portal.acm.org/citation.cfm?id=608141.608166 http://dx.doi.org/10.1023/A:1021749005009 [Crossref]

  • [54] Lundberg L., Analyzing fixed-priority global multiprocessor scheduling. In: RTAS’ 02, Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS’02), p. 145. IEEE Computer Society, Washington, DC, USA, 2002 http://dx.doi.org/10.1109/RTTAS.2002.1137389 [Crossref]

  • [55] Mok A.K., Fundamental design problems of distributed systems for the hard-real-time environment. Tech. rep., Massachusetts Institute of Technology, Cambridge, MA, USA, 1983

  • [56] Müller D., Accelerated simply periodic task sets for RM scheduling. In: Proc. of Embedded Real Time Software and Systems (ERTS2), 46, Toulouse, 2010, http://www.erts2010.org/Site/0ANDGY78/Fichier/PAPIERS%20ERTS%202010%202/ERTS2010_0140_final.pdf

  • [57] Nelissen G., Berten V., Goossens J.G., Milojevic D., An optimal multiprocessor scheduling algorithm without fairness. In: In Proceedings of the 31th IEEE Real-Time Systems Symposium (Work in Progress session — RTSS10-WiP), 2010

  • [58] Niz D.d., Lakshmanan K., Rajkumar R., On the scheduling of mixed-criticality real-time task sets. In: RTSS’ 09, Proceedings of the 2009 30th IEEE Real-Time Systems Symposium, 291–300, IEEE Computer Society, Washington, DC, USA, 2009 http://dx.doi.org/10.1109/RTSS.2009.46 [Crossref]

  • [59] Oh D.I., Baker T.P., Utilization bounds for n-processor rate monotone scheduling with static processor assignment. Real-Time Systems, 1998, 15(2), 183–192 http://dx.doi.org/10.1023/A:1008098013753 [Crossref]

  • [60] Parekh A.K., Gallager R.G., A generalized processor sharing approach to flow control in integrated services networks, the single-node case. IEEE/ACM Trans. Netw., 1993, 1(3), 344–357 http://dx.doi.org/10.1109/90.234856 [Crossref]

  • [61] Ramamritham K., Stankovic J.A., Shiah P.F., Efficient scheduling algorithms for real-time multiprocessor systems. IEEE Trans. Parallel Distrib. Syst., 1990, 1(2), 184–194 http://dx.doi.org/10.1109/71.80146 [Crossref]

  • [62] Srinivasan A., Baruah S., Deadline-based scheduling of periodic task systems on multiprocessors. Inf. Process. Lett., 2002, 84(2), 93–98 http://dx.doi.org/10.1016/S0020-0190(02)00231-4 [Crossref]

  • [63] Takeda A., Kato S., Yamasaki N., Real-time scheduling based on rate monotonic for multiprocessors (in japanese). IPSJ Transactions on Advanced Computing Systems, 2009, 2(1), 64–74

  • [64] Yao G., Buttazzo G., Bertogna M., Comparative evaluation of limited preemptive methods. In: Proc. of the 15th IEEE Int’l Conf. on Emerging Technologies and Factory Automation (ETFA 2010). Bilbao, Spain, 2010, http://retis.sssup.it/~marko/papers/ETFA10.pdf

  • [65] Yao G., Buttazzo G., Bertogna M., Feasibility analysis under fixed priority scheduling with fixed preemption points. In: Proc. of the 16th IEEE Int’l Conf. on Embedded and Real-Time Computing Systems and Applications (RTCSA 2010). Macau, China, 2010, http://retis.sssup.it/~marko/papers/RTCSA10.pdf

  • [66] Zuhily A., Burns A., Optimal (D-J)-monotonic priority assignment. Inf. Process. Lett., 2007, 103(6), 247–250 http://dx.doi.org/10.1016/j.ipl.2007.04.006 [Crossref]

About the article

Published Online: 2011-09-28

Published in Print: 2011-09-01



Citation Information: Open Computer Science, ISSN (Online) 2299-1093, DOI: https://doi.org/10.2478/s13537-011-0023-z. Export Citation

© 2011 Versita Warsaw. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License. (CC BY-NC-ND 3.0)

Comments (0)

Please log in or register to comment.
Log in