Skip to main content
Log in

Mixed-criticality scheduling on multiprocessors

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

The scheduling of mixed-criticality implicit-deadline sporadic task systems on identical multiprocessor platforms is considered. Two approaches, one for global and another for partitioned scheduling, are described. Theoretical analyses and simulation experiments are used to compare the global and partitioned scheduling approaches.

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

Notes

  1. We assume that the run-time system provides support for ensuring that jobs do not execute for more than a specified amount; see, e.g., Baruah et al. (2011b) for a discussion of this issue.

  2. By applying some results from Baruah et al. (2012), this result can easily be improved to show that the speedup bound is actually no more than ((4/3)+ϵ).

  3. Although this is not a multiprocessor example, it serves to illustrate the steps taken by the algorithm in a relatively simple manner.

  4. Observe that these conditions are exactly the ones that we have generalized in order to come up with the conditions P1–P2 (Eqs. (2) and (3)) in Sect. 5.2.

References

  • Baker T (2005) Comparison of empirical success rates of global vs. partitioned fixed-priority and EDF scheduling for hard real time. Tech Rep TR-050601, Department of Computer Science, Florida State University

  • Baker T (2006) A comparison of global and partitioned EDF schedulability tests for multiprocessors. In: Proceeding of the international conference on real-time and network systems, Poitiers, France

    Google Scholar 

  • Baker T, Baruah S (2009) Sustainable multiprocessor scheduling of sporadic task systems. In: Proceedings of the EuroMicro conference on real-time systems. IEEE Computer Society Press, Dublin

    Google Scholar 

  • Baruah S (2004) Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors. IEEE Trans Comput 53(6)

  • Baruah S, Burns A (2006) Sustainable scheduling analysis. In: Proceedings of the IEEE real-time systems symposium. IEEE Computer Society Press, Rio de Janeiro, pp 159–168

    Google Scholar 

  • Baruah S, Fohler G (2011) Certification-cognizant time-triggered scheduling of mixed-criticality systems. In: Proceedings of the IEEE real-time systems symposium (RTSS). IEEE Computer Society Press, Vienna

    Google Scholar 

  • Baruah S, Bonifaci V, D’Angelo G, Marchetti-Spaccamela A, van der Ster S, Stougie L (2011a) Mixed-criticality scheduling of sporadic task systems. In: Proceedings of the 19th annual European symposium on algorithms. Springer, Saarbrucken, pp 555–566

    Google Scholar 

  • Baruah S, Burns A, Davis R (2011b) Response-time analysis for mixed criticality systems. In: Proceedings of the IEEE real-time systems symposium (RTSS). IEEE Computer Society Press, Vienna

    Google Scholar 

  • Baruah S, Bonifaci V, D’Angelo G, Li H, Marchetti-Spaccamela A, van der Ster S, Stougie L (2012) The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems. In: Proceedings of the 2012 24th euromicro conference on real-time systems ECRTS’12. IEEE Computer Society, Pisa

    Google Scholar 

  • Bertogna M (2008) Real-time scheduling analysis for multiprocessor platforms. PhD thesis, Scuola Superiore Santa Anna, Pisa, Italy

  • Bertogna M (2009) Evaluation of existing schedulability tests for global EDF. In: ICPPW’09: proceedings of the 2009 international conference on parallel processing workshops. IEEE Computer Society, Washington, pp 11–18. doi:10.1109/ICPPW.2009.12

    Chapter  Google Scholar 

  • Chekuri C, Khanna S (1999) On multi-dimensional packing problems. In: Proceedings of the tenth annual ACM-SIAM symposium on discrete algorithms, pp 185–194

    Google Scholar 

  • Chekuri C, Khanna S (2004) On multidimensional packing problems. SIAM J Comput 33(4):837–851. doi:10.1137/S0097539799356265

    Article  MathSciNet  MATH  Google Scholar 

  • de Niz D, Lakshmanan K, Rajkumar RR (2009) On the scheduling of mixed-criticality real-time task sets. In: Proceedings of the real-time systems symposium. IEEE Computer Society Press, Washington, pp 291–300

    Google Scholar 

  • Dertouzos M (1974) Control robotics: the procedural control of physical processors. In: Proceedings of the IFIP Congress, pp 807–813

    Google Scholar 

  • Dorin F, Richard P, Richard M, Goossens J (2010) Schedulability and sensitivity analysis of multiple criticality tasks with fixed-priorities. Real-Time Systems

  • Ekberg P, Yi W (2012) Bounding and shaping the demand of mixed-criticality sporadic tasks. In: Proceedings of the 2012 24th euromicro conference on real-time systems ECRTS’12. IEEE Computer Society, Pisa

    Google Scholar 

  • Guan N, Ekberg P, Stigge M, Yi W (2011) Effective and efficient scheduling for certifiable mixed criticality sporadic task systems. In: Proceedings of the IEEE real-time systems symposium (RTSS). IEEE Computer Society Press, Vienna

    Google Scholar 

  • Guan N, Ekberg P, Stigge M, Yi W (2013) Improving the scheduling of certifiable mixed-criticality sporadic task systems. Tech Rep 2013-008, Department of Information Technology, Uppsala University

  • Herman J, Kenna C, Mollison M, Anderson J, Johnson D (2012) RTOs support for multicore mixed-criticality systems. In: Proceedings of the 2012 IEEE real-time and embedded technology and applications symposium RTAS’12. IEEE Computer Society, Beijing

    Google Scholar 

  • Huang HM, Gill C, Lu C (2012) Implementation and evaluation of mixed-criticality scheduling algorithms for periodic tasks. In: Proceedings of the 2012 IEEE real-time and embedded technology and applications symposium RTAS’12. IEEE Computer Society, Beijing

    Google Scholar 

  • Kalyanasundaram B, Pruhs K (2000) Speed is as powerful as clairvoyance. J ACM 37(4):617–643

    Article  MathSciNet  Google Scholar 

  • Lakshmanan K, de Niz D, Rajkumar RR, Moreno G (2010) Resource allocation in distributed mixed-criticality cyber-physical systems. In: Proceedings of the 30th international conference of distributed computing systems. IEEE Computer Society Press, New York

    Google Scholar 

  • Lakshmanan K, de Niz D, Rajkumar RR (2011) Mixed-criticality task synchronization in zero-slack scheduling. In: Proceedings of the real-time and embedded technology and applications symposium. IEEE Computer Society Press, Chicago

    Google Scholar 

  • Li H, Baruah S (2012) Global mixed-criticality scheduling on multiprocessors. In: Proceedings of the 2012 24th euromicro conference on real-time systems ECRTS’12. IEEE Computer Society, Pisa

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Mollison M, Erickson J, Anderson J, Baruah S, Scoredos J (2010) Mixed-criticality real-time scheduling for multicore systems. In: Proceedings of the IEEE international conference on embedded systems and software. IEEE Computer Society Press, Bradford

    Google Scholar 

  • Park T, Kim S (2011) Dynamic scheduling algorithm and its schedulability analysis for certifiable dual-criticality systems. In: Proceedings of the 11th international conference on embedded software, EMSOFT-2011, pp 253–262

    Google Scholar 

  • Pathan R (2012) Schedulability analysis of mixed-criticality systems on multiprocessors. In: Proceedings of the 2012 24th euromicro conference on real-time systems ECRTS’12. IEEE Computer Society, Pisa

    Google Scholar 

  • Santy F, George L, Thierry P, Goossens J (2012) Relaxing mixed-criticality scheduling strictness for task sets scheduled with FP. In: Proceedings of the 2012 24th euromicro conference on real-time systems ECRTS’12. IEEE Computer Society, Pisa

    Google Scholar 

  • Tamas-Selicean D, Pop P (2011) Design optimization of mixed-criticality real-time applications on cost-constrained partitioned architectures. In: Proceedings of the IEEE real-time systems symposium (RTSS). IEEE Computer Society Press, Vienna

    Google Scholar 

  • Vestal S (2007) Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In: Proceedings of the real-time systems symposium. IEEE Computer Society Press, Tucson, pp 239–243

    Google Scholar 

  • Yun H, Yao G, Pellizzoni R, Caccamo M, Sha L (2012) Memory access control in multiprocessor for real-time systems with mixed criticality. In: Proceedings of the 2012 24th euromicro conference on real-time systems ECRTS’12. IEEE Computer Society, Pisa

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sanjoy Baruah.

Additional information

Work supported by NSF grants CNS 1218693, CNS 1016954, and CNS 1115284; ARO grant W911NF-09-1-0535; AFOSR grant FA9550-09-1-0549; AFRL grant FA8750-11-1-0033; BRL (2009-0086964); BSRP (2010-0006650, 2012-R1A1A1014930); KEIT (2011-10041313); DGIST CPS Global Center funded by Korea Government (MEST/MKE).

Rights and permissions

Reprints and permissions

About this article

Cite this article

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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-013-9184-2

Keywords

Navigation