Abstract
Real-time systems are increasingly involved in mixed-criticality tasks with different criticality levels. However, the focus is increasing on the multiprocessor systems that can help in reducing the cost, space, weight, time, and power consumption. There is significantly less work done in the literature to design a global scheduling algorithm for multiprocessor mixed-criticality systems. In this paper, we propose a global scheduling algorithm based on the DP-Fair scheduling algorithm for multiprocessor mixed-criticality systems. We also show that our proposed algorithm dominates the existing global scheduling algorithm in terms of the number of successful scheduling instances.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Baruah, S., et al.: Scheduling real-time mixed-criticality jobs. IEEE Trans. Comput. 61(8), 1140–1152 (2012)
Baruah, S., et al.: The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems. In: 2012 24th Euromicro Conference on Real-Time Systems (ECRTS), pp. 145–154. IEEE (2012)
Baruah, S., Chattopadhyay, B., Li, H., Shin, I.: Mixed-criticality scheduling on multiprocessors. Real Time Syst. 50(1), 142–177 (2014)
Baruah, S., Fohler, G.: Certification-cognizant time-triggered scheduling of mixed-criticality systems. In: 32nd IEEE Real-Time Systems Symposium (RTSS), pp. 3–12. IEEE (2011)
Behera, L., Bhaduri, P.: Time-triggered scheduling of mixed-criticality systems. ACM Trans. Des. Autom. Electron. Syst. (TODAES) 22(4), 74 (2017)
Behera, L., Bhaduri, P.: Time-Triggered scheduling for multiprocessor mixed-criticality systems. In: Negi, A., Bhatnagar, R., Parida, L. (eds.) ICDCIT 2018. LNCS, vol. 10722, pp. 135–151. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-72344-0_10
Davis, R.I., Zabos, A., Burns, A.: Efficient exact schedulability tests for fixed priority real-time systems. IEEE Trans. Comput. 57(9), 1261–1276 (2008)
Emberson, P., Stafford, R., Davis, R.I.: Techniques for the synthesis of multiprocessor tasksets. In: Proceedings 1st International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS 2010), pp. 6–11 (2010)
Levin, G., Funk, S., Sadowski, C., Pye, I., Brandt, S.: DP-FAIR: a simple model for understanding optimal multiprocessor scheduling. In: 2010 22nd Euromicro Conference on Real-Time Systems, pp. 3–13, July 2010
Vestal, S.: Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In: 28th IEEE International Real-Time Systems Symposium. RTSS 2007, pp. 239–243, December 2007
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Behera, L. (2022). MCDPS: An Improved Global Scheduling Algorithm for Multiprocessor Mixed-Criticality Systems. In: Bapi, R., Kulkarni, S., Mohalik, S., Peri, S. (eds) Distributed Computing and Intelligent Technology. ICDCIT 2022. Lecture Notes in Computer Science(), vol 13145. Springer, Cham. https://doi.org/10.1007/978-3-030-94876-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-94876-4_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-94875-7
Online ISBN: 978-3-030-94876-4
eBook Packages: Computer ScienceComputer Science (R0)