Advertisement

Semi-partitioned Multiprocessor Scheduling

  • Björn AnderssonEmail author
Living reference work entry

Abstract

It is often desirable to use a real-time scheduler for multiprocessors so that the scheduler (i) can meet deadlines even at high processor utilization and (ii) generates few preemptions. Semi-partitioning (or task-splitting) is an idea to achieve this. This chapter explains this idea and lists papers in the area.

References

  1. J.H. Anderson, V. Bud, U.C. Devi, An EDF-based scheduling algorithm for multiprocessor soft real-time systems, in Euromicro Conference on Real-Time Systems, ed. by E. Tovar (2005), pp. 199–208Google Scholar
  2. B. Andersson, K. Bletsas, Sporadic multiprocessor scheduling with few preemptions, in Euromicro Conference on Real-Time Systems, ed. by A. Burns (2008), pp. 243–252Google Scholar
  3. B. Andersson, E. Tovar, Multiprocessor scheduling with few preemptions, in IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, ed. by C.-W. Hseuh, R. West (2006), pp. 322–334Google Scholar
  4. B. Andersson, K. Bletsas, S.K. Baruah, Scheduling arbitrary-deadline sporadic task systems on multiprocessors, in IEEE Real-Time Systems Symposium, ed. by S. Goddard (2008), pp. 385–394Google Scholar
  5. A. Bastoni, B. Brandenburg, J.H. Anderson, Is semi-partitioned scheduling practical? in Euromicro Conference on Real-Time Systems, ed. by K.-E. Årzen (2011), pp. 125–135Google Scholar
  6. K. Bletsas, B. Andersson, Notional processors: an approach for multiprocessor scheduling, in IEEE Real-Time and Embedded Technology and Applications Symposium, ed. by N. Audsley (2009), pp. 3–12Google Scholar
  7. K. Bletsas, B. Andersson, Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound. J. Real-Time Syst. 47(4), 319–355 (2011)CrossRefGoogle Scholar
  8. B. Brandenburg, M. Gül, Global scheduling not required: simple, near-optimal. Multiprocessor real-time scheduling with semi-partitioned reservations, in IEEE Real-Time Systems Symposium, ed. by F. Mueller (2016), pp. 99–110Google Scholar
  9. A. Burns, R. Davis, P. Wang, F. Zhang, Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme. J. Real-Time Syst. 48(1), 3–33 (2012)CrossRefGoogle Scholar
  10. H. Cho, B. Ravindran, E.D. Jensen, An optimal real-time scheduling algorithm for multiprocessors, in IEEE Real-Time Systems Symposium, ed. by T. Abdelzaher, G. Fohler (2006), pp. 101–110Google Scholar
  11. M. Fan, G. Guan, Harmonic-aware multi-core scheduling for fixed-priority real-time systems. IEEE Trans. Parallel Distrib. Syst. 25(6), 1476–1488 (2014)CrossRefGoogle Scholar
  12. L. George, P. Courbin, Y. Sorel, Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling. J. Syst. Arch. 57(5), 518–535 (2011)Google Scholar
  13. N. Guan, M. Stigge, W. Yi, G. Yu, Fixed-priority multiprocessor scheduling with Liu & Layland’s utilization bound, in IEEE Real-Time and Embedded Technology and Applications Symposium, ed. by N. Audsley (2010), pp. 165–174Google Scholar
  14. A. Kandhalu, K. Lakshamanan, R. Rajkumar, pCOMPATS: period-compatible task allocation and splitting on multi-core processors, in IEEE Real-Time and Embedded Technology and Applications Symposium, ed. by M.D. Natale (2012), pp. 307–316Google Scholar
  15. S. Kato, N. Yamasaki, Real-time scheduling with task splitting on multiprocessors, in IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, ed. by S. Baruah, N. Chang, Y. Tobe (2007), pp. 441–450Google Scholar
  16. S. Kato, N. Yamasaki, Portioned EDF-based scheduling on multiprocessors, in ACM International Conference on Embedded Software, ed. by L. Alfaro, J. Palsberg (2008a), pp 139–148Google Scholar
  17. S. Kato, N. Yamasaki, Portioned static-priority scheduling on multiprocessors, in IEEE International Parallel & Distributed Processing Symposium, ed. by Y. Robert (2008b)Google Scholar
  18. S. Kato, N. Yamasaki, Semi-partitioned fixed-priority scheduling on multiprocessors, in IEEE Real-Time and Embedded Technology and Applications Symposium, ed. by N. Audsley (2009), pp. 23–32Google Scholar
  19. S. Kato, R. Rajkumar, Y. Ishikawa, A loadable real-time scheduler suite for multicore platforms, in CMU-ECE-TR09-12, Technical Report (2009a)Google Scholar
  20. S. Kato, N. Yamasaki, Y. Ishikawa, Semi-partitioned scheduling of sporadic task systems on multiprocessors, in Euromicro Conference on Real-Time Systems, ed. by I. Puaut (2009b), pp. 249–258Google Scholar
  21. S. Kato, R. Rajkumar, Y. Ishikawa, AIRS: supporting interactive real-time applications on multicore platforms, in Euromicro Conference on Real-Time Systems, ed. by J.H. Anderson (2010), pp 47–56Google Scholar
  22. K. Lakshmanan, R. Rajkumar, J. Lehoczky, Partitioned fixed-priority preemptive scheduling for multi-core processors, in Euromicro Conference on Real-Time Systems, ed. by I. Puaut (2009), pp. 239–248Google Scholar
  23. J. Leung, J. Whitehead, On the complexity of fixed-priority scheduling of periodic, real-time tasks. Perform. Eval. 2(4), 237–250 (1982)MathSciNetCrossRefGoogle Scholar
  24. G. Levin, S. Funk, C. Sadowski, I. Pye, S. Brandt, DP-FAIR: a simple model for understanding optimal multiprocessor scheduling, in Euromicro Conference on Real-Time Systems, ed. by J.H. Anderson (2010), pp. 3–13Google Scholar
  25. C.L. Liu, J.W. Layland, Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46–61 (1973)MathSciNetCrossRefGoogle Scholar
  26. E. Massa, G. Lima, P. Regnier, G. Levin, S.A. Brandt, Outstanding paper: optimal and adaptive multiprocessor real-time scheduling: the quasi-partitioning approach, in Euromicro Conference on Real-Time Systems, ed. by R. Ernst (2014), pp. 291–300Google Scholar
  27. A. Mok, Fundamental design problems of distributed systems for the hard-real-time environment. PhD thesis, Massachusetts Institute of Technology (1983)Google Scholar
  28. G. Nelissen, V. Berten, V. Nélis, J. Goossens, D. Milojevic, U-EDF: an unfair but optimal multiprocessor scheduling algorithm for sporadic tasks, in Euromicro Conference on Real-Time Systems, ed. by R. Davis (2012), pp. 13–23Google Scholar
  29. P. Regnier, G. Lima, E. Massa, G. Levin, S.A. Brandt, Run: optimal multiprocessor real-time scheduling via reduction to uniprocessor, in IEEE Real-Time Systems Symposium, ed. by L. Almeida (2011), pp. 104–115Google Scholar
  30. J.A. Santos, G. Lima, K. Bletsas, S. Kato, Multiprocessor real-time scheduling with a few migrating tasks, in IEEE Real-Time Systems Symposium, ed. by M.G. Harbour (2013), pp. 170–181Google Scholar
  31. P.B. Sousa, B. Andersson, E. Tovar, Challenges and design principles for implementing slot-based task-splitting multiprocessor scheduling, in IEEE Real-Time Systems Symposium, Work-in-Progress (2010)Google Scholar
  32. P.B. Sousa, B. Andersson, E. Tovar, Implementing slot-based task-splitting multiprocessor scheduling, in IEEE International Symposium on Industrial Embedded Systems, ed. by I. Bate, R. Passerone (2011a), pp. 256–265Google Scholar
  33. P.B. Sousa, K. Bletsas, B. Andersson, E. Tovar, Practical aspects of slot-based task-splitting dispatching in its schedulability analysis, in IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, ed. by S. Oikawa, N. Audsley, C.-G. Lee (2011b), pp. 224–230Google Scholar
  34. P.B. Sousa, K. Bletsas, E. Tovar, B. Andersson, On the implementation of real-time slot-based task-splitting scheduling algorithms for multiprocessor systems, in Real-Time Linux Workshop (2011c)Google Scholar
  35. P.B. Sousa, N. Pereira, E. Tovar, Enhancing the real-time capabilities of the Linux kernel, in Euromicro Conference on Real-Time Systems, Work-in-Progress (2012)Google Scholar
  36. P.B. Sousa, K. Bletsas, B. Andersson, E. Tovar, The carousel-EDF scheduling algorithm for multiprocessor systems, in IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, ed. by L.-P. Chang, C. Gill, J. Nakazawa (2013), pp. 12–21Google Scholar
  37. P.B. Sousa, K. Bletsas, E. Tovar, P. Souto, B. Åkesson, Unified overhead-aware schedulability analysis for slot-based task-splitting. J. Real-Time Syst. 50(5–6), 680–735 (2014)CrossRefGoogle Scholar
  38. P. Souto, P.B. Sousa, R. Davis, K. Bletsas, E. Tovar, Overhead-aware schedulability evaluation of semi-partitioned real-time schedulers, in IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, ed. by S. Chakraborty, Q. Wang, S. Hong (2015), pp. 110–121Google Scholar
  39. D. Zhu, D. Mossé, R.G. Melhem, Multiple-resource periodic scheduling problem: how much fairness is necessary? in IEEE Real-Time Systems Symposium, ed. by R.R. Rajkumar (2003), pp. 142–151Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Software Engineering InstituteCarnegie Mellon UniversityPittsburghUSA

Section editors and affiliations

  • Arvind Easwaran
    • 1
  1. 1.School of Computer Science and EngineeringNanyang Technological UniversitySingaporeSingapore

Personalised recommendations