Skip to main content
Log in

Semi-partitioned scheduling of mixed-criticality system on multiprocessor platforms

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Many functions are now integrated into one computing platform to make full use of limited resources in real-time embedded systems. But most integrated functions do not have the same criticality. So many scheduling algorithms of mixed-criticality system have been proposed and studied. When all HI-criticality tasks meet deadlines in a multiprocessor mixed-criticality system, how to maximize the system resource utilization is a challenging work. Although global and partitioned mixed-criticality algorithms widely studied, they still have some shortcomings. For the purpose of finding a balance point between partitioned scheduling and global scheduling in mixed-criticality systems, the semi-partitioned scheduling algorithm proposed in recent years is a compromise method for real-time systems. In this paper, we propose a complete semi-partitioned scheduling algorithm for multiprocessor mixed-criticality systems to improve system resource utilization. The sufficient conditions for schedulability and speedup bound of the new algorithm are derived and proven. Compared with speedup bounds of other algorithms, the new algorithm is closer to the optimal algorithm for multiprocessor mixed-criticality system. We also propose two improved algorithms based on the virtual deadline of the task to balance the relationship between task criticality and task priority. Finally, a large number of experimental simulation results show that these new algorithms in mixed-criticality system can better improve system resource utilization compared to other algorithms.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Vestal S (2007) Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In: 28th IEEE International Real-Time Systems Symposium, pp 239–243. https://doi.org/10.1109/RTSS.2007.47

  2. Baruah S, Vestal S (2008) Schedulability analysis of sporadic tasks with multiple criticality specifications. In: 2008 Euromicro Conference on Real-Time Systems, pp 147–155. https://doi.org/10.1109/ECRTS.2008.26

  3. Baruah S, Burns A, Davis RI (2011) Response-time analysis for mixed criticality systems. In: 2011 IEEE 32nd Real-Time Systems Symposium, pp 34–43. https://doi.org/10.1109/RTSS.2011.12

  4. Baruah S, Li H, Stougie L (2010) Towards the design of certifiable mixed-criticality systems. In: 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium, pp 13–22. https://doi.org/10.1109/RTAS.2010.10

  5. Baruah S, et al. (2012) The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems. In: 2012 24th Euromicro Conference on Real-Time Systems, pp 145–154. https://doi.org/10.1109/ECRTS.2012.42

  6. Herman JL, Kenna CJ, Mollison MS, Anderson JH, Johnson DM (2012) RTOS support for multicore mixed-criticality systems. In: 2012 IEEE 18th Real Time and Embedded Technology and Applications Symposium, pp 197–208. https://doi.org/10.1109/RTAS.2012.24

  7. Bhuiyan AA, Yang K, Arefin S, Saifullah A, Guan N, Guo Z (2019) Mixed-criticality multicore scheduling of real-time gang task systems. In: 2019 IEEE Real-Time Systems Symposium (RTSS), pp 469–480. https://doi.org/10.1109/RTSS46320.2019.00048

  8. Guo Z, Sruti S, Ward BC, Baruah S (2017) Sustainability in mixed-criticality scheduling. In: 2017 IEEE Real-Time Systems Symposium (RTSS), pp 24–33. https://doi.org/10.1109/RTSS.2017.00010

  9. Li H, Baruah S (2012) Outstanding paper award: global mixed-criticality scheduling on multiprocessors. In: 2012 24th Euromicro Conference on Real-Time Systems, pp 166–175. https://doi.org/10.1109/ECRTS.2012.41

  10. Baruah S, Chattopadhyay B, Li H, Shin I (2014) Mixed-criticality scheduling on multiprocessors. Real-Time Syst 38:142–177. https://doi.org/10.1007/s11241-013-9184-2

    Article  MATH  Google Scholar 

  11. James H, Anderson VB, Uma Maheswari C, Devi C (2008) An EDF-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems. Real-Time Syst 38:85–131. https://doi.org/10.1007/s11241-007-9035-0

    Article  MATH  Google Scholar 

  12. Anderson JH, Erickson JP, Devi UMC, Casses BN (2016) Optimal semi-partitioned scheduling in soft real-time systems. J Signal Process Syst 84:3–23. https://doi.org/10.1007/s11265-015-0983-7

    Article  Google Scholar 

  13. Hobbs C, Tong Z, Anderson JH (2019) Optimal soft real-time semi-partitioned scheduling made simple (and dynamic). In: RTNS ’19: Proceedings of the 27th International Conference on Real-Time Networks and Systems, pp 112–122. https://doi.org/10.1145/3356401.3356402

  14. Andersson B, Tovar E (2006) Multiprocessor scheduling with few preemptions. In: 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA’06), pp 322–334. https://doi.org/10.1109/RTCSA.2006.45

  15. Burns A, Davis RI, Wang P, Zhang F (2012) Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme. Real-Time Syst 48:3–33. https://doi.org/10.1007/s11241-011-9126-9

    Article  MATH  Google Scholar 

  16. Bletsas K, Andersson B (2011) Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound. Real-Time Syst 47:319–355. https://doi.org/10.1007/s11241-011-9114-0

    Article  MATH  Google Scholar 

  17. Bletsas K, Petters SM (2013) Using NPS-F for mixed-criticality multicore systems. ACM SIGBED Rev 10:36–36. https://doi.org/10.1145/2518148.2518174

    Article  Google Scholar 

  18. Xu H, Burns A (2015) Semi-partitioned model for dual-core mixed criticality system. In: Proceedings of the 23rd International Conference on Real Time and Networks Systems, pp 257–266. https://doi.org/10.1145/2834848.2834865

  19. Hao X, Burns A (2019) A semi-partitioned model for mixed criticality systems. J Syst Softw 150:51–63. https://doi.org/10.1016/j.jss.2019.01.015

    Article  Google Scholar 

  20. Zeng L, Lei Y, Li Y (2019) A semi-partition algorithm for mixed-criticality tasks in multiprocessor platform. In: 2019 IEEE 10th International Conference on Software Engineering and Service Science (ICSESS), pp 694–697. https://doi.org/10.1109/ICSESS47205.2019.9040792

  21. Awan MA, Bletsas K, Souto PF, Tovar E (2017) Semi-partitioned mixed-criticality scheduling, architecture of computing systems-ARCS 2017, pp 205–218. https://doi.org/10.1007/978-3-319-54999-6_16

  22. Lopez JM, Garcia M, Diaz JL, Garcia DF (2000) Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems. In: Proceedings 12th Euromicro Conference on Real-Time Systems, pp 25–33. https://doi.org/10.1109/EMRTS.2000.853989

  23. Guan N, Ekberg P, Stigge M, Yi W (2011) Effective and efficient scheduling of certifiable mixed-criticality sporadic task systems. In: 2011 IEEE 32nd Real-Time Systems Symposium (RTSS), pp 13–23. https://doi.org/10.1109/RTSS.2011.10

  24. Bastoni A, Brandenburg BB, Anderson JH (2010) Cache-related preemption and migration delays: Empirical approximation and impact on schedulability, OSPERT, pp 33–44

  25. Lehoczky J, Sha L, Ding Y (1989) The rate monotonic scheduling algorithm: exact characterization and average case behavior. Real-time systems symposium, pp 166–171. https://doi.org/10.1109/REAL.1989.63567

  26. Liu CL, James L (1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. J ACM (JACM) 20:46–61

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

We would like to express our very great appreciation to the East-China Institute of Computing Technology for providing the necessary tools for this project.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Han Wang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yang, C., Wang, H., Zhang, J. et al. Semi-partitioned scheduling of mixed-criticality system on multiprocessor platforms. J Supercomput 78, 6386–6410 (2022). https://doi.org/10.1007/s11227-021-04101-y

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-021-04101-y

Keywords

Navigation