Skip to main content
SpringerLink
Log in

Semi-partitioned Multiprocessor Scheduling

  • Reference work entry
  • First Online:
Handbook of Real-Time Computing

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 999.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 849.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • 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–208

    Google Scholar 

  • B. Andersson, K. Bletsas, Sporadic multiprocessor scheduling with few preemptions, in Euromicro Conference on Real-Time Systems, ed. by A. Burns (2008), pp. 243–252

    Google Scholar 

  • 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–334

    Google Scholar 

  • 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–394

    Google Scholar 

  • 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–135

    Google Scholar 

  • 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–12

    Google Scholar 

  • K. Bletsas, B. Andersson, Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound. J. Real-Time Syst. 47(4), 319–355 (2011)

    Article  Google Scholar 

  • 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–110

    Google Scholar 

  • 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)

    Article  Google Scholar 

  • 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–110

    Google Scholar 

  • 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)

    Article  Google Scholar 

  • 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 

  • 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–174

    Google Scholar 

  • 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–316

    Google Scholar 

  • 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–450

    Google Scholar 

  • 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–148

    Google Scholar 

  • S. Kato, N. Yamasaki, Portioned static-priority scheduling on multiprocessors, in IEEE International Parallel & Distributed Processing Symposium, ed. by Y. Robert (2008b)

    Google Scholar 

  • 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–32

    Google Scholar 

  • 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 

  • 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–258

    Google Scholar 

  • 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–56

    Google Scholar 

  • 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–248

    Google Scholar 

  • J. Leung, J. Whitehead, On the complexity of fixed-priority scheduling of periodic, real-time tasks. Perform. Eval. 2(4), 237–250 (1982)

    Article  MathSciNet  Google Scholar 

  • 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–13

    Google Scholar 

  • C.L. Liu, J.W. Layland, Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46–61 (1973)

    Article  MathSciNet  Google Scholar 

  • 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–300

    Google Scholar 

  • A. Mok, Fundamental design problems of distributed systems for the hard-real-time environment. PhD thesis, Massachusetts Institute of Technology (1983)

    Google Scholar 

  • 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–23

    Google Scholar 

  • 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–115

    Google Scholar 

  • 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–181

    Google Scholar 

  • 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 

  • 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–265

    Google Scholar 

  • 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–230

    Google Scholar 

  • 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 

  • 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 

  • 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–21

    Google Scholar 

  • 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)

    Article  Google Scholar 

  • 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–121

    Google Scholar 

  • 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–151

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software Engineering Institute, Carnegie Mellon University, Pittsburgh, PA, USA

    Björn Andersson

Authors
  1. Björn Andersson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Björn Andersson .

Editor information

Editors and Affiliations

  1. School of Computer Science, Queensland University of Technology, Brisbane, QLD, Australia

    Yu-Chu Tian

  2. School of Electrical and Information Engineering, The University of Sydney, Sydney, NSW, Australia

    David Charles Levy

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Singapore Pte Ltd

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Andersson, B. (2022). Semi-partitioned Multiprocessor Scheduling. In: Tian, YC., Levy, D.C. (eds) Handbook of Real-Time Computing. Springer, Singapore. https://doi.org/10.1007/978-981-287-251-7_2

Download citation

Publish with us

Policies and ethics

Search

Navigation