Abstract
Many safety-critical embedded systems are subject to certification requirements. However, only a subset of the functionality of the system may be safety-critical and hence subject to certification; the rest of the functionality is non safety-critical and does not need to be certified, or is certified to a lower level. The resulting mixed criticality system offers challenges both for static analysis and run-time monitoring. This paper is concerned with timing failures and how they can arise and be tolerated. The main causes of these errors are faults in the estimation of worst-case execution times (WCETs). For different levels of criticality, different forms of static analysis for WCET are employed. This give rise to a novel implementation scheme for the fixed priority uniprocessor scheduling of mixed criticality systems. The scheme requires that jobs have their execution times monitored (as is usually the case in high integrity systems). This results in higher levels of schedulability than previously published.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
de Niz, D., Lakshmanan, K., Rajkumar, R.: On the scheduling of mixed-criticality real-time task sets. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 291–300 (2009)
Vestal, S.: Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In: Proceedings of the IEEE Real-Time Systems Symposium, Tucson, AZ, pp. 239–243. IEEE Computer Society Press, Los Alamitos (2007)
Baruah, S., Vestal, S.: Schedulability analysis of sporadic tasks with multiple criticality specifications. In: ECRTS, pp. 147–155 (2008)
Baruah, S., Li, H., Stougie, L.: Towards the design of certifiable mixed-criticality systems. In: Proceedings of the IEEE Real-Time Technology and Applications Symposium (RTAS). IEEE, Los Alamitos (2010)
Baruah, S., Bonifaci, V., D’Angelo, G., Li, H., Marchetti-Spaccamela, A., Megow, N., Stougie, L.: Scheduling real-time mixed-criticality jobs. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 90–101. Springer, Heidelberg (2010)
Mok, A.K.: Fundamental Design Problems of Distributed Systems for The Hard-Real-Time Environment. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology (1983), available as Technical Report No. MIT/LCS/TR-297
Baruah, S., Mok, A., Rosier, L.: Preemptively scheduling hard-real-time sporadic tasks on one processor. In: Proceedings of the 11th Real-Time Systems Symposium, Orlando, Florida, pp. 182–190. IEEE Computer Society Press, Los Alamitos (1990)
Audsley, N.: On priority assignment in fixed priority scheduling. Information Processing Letters 79, 39–44 (2001)
Li, H., Baruah, S.: An algorithm for scheduling certifiable mixed-criticality sporadic task systems. In: Proceedings of the Real-Time Systems Symposium, San Diego, CA, pp. 183–192. IEEE Computer Society Press, Los Alamitos (2010)
Baruah, S., Burns, A.: Implementing mixed criticality systems in ada. In: Romanovsky, A., Vardanega, T. (eds.) Ada-Europe 2011. LNCS, vol. 6652, pp. 174–188. Springer, Heidelberg (2011)
Leung, J., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation 2, 237–250 (1982)
Burns, A., Littlewood, B.: Reasoning about the reliability of multi-version, diverse real-time systems. In: Proceedings of IEEE Real-Time Systems Symposium (RTSS), pp. 73–81. IEEE Computer Society, Los Alamitos (2010)
Abeni, L., Buttazzo, G.: Integrating multimedia applications in hard real-time systems. In: Proceedings of the Real-Time Systems Symposium, Madrid, Spain, pp. 3–13. IEEE Computer Society, Los Alamitos (1998)
Bernat, G., Burns, A.: New results on fixed priority aperiodic servers. In: Proceedings 20th IEEE Real-Time Systems Symposium, pp. 68–78 (1999)
Caccamo, M., Sha, L.: Aperiodic servers with resource constraints. In: Proceedings of the IEEE Real-Time Systems Symposium (2001)
Bernat, G., Burns, A.: Multiple servers and capacity sharing for implementing flexible scheduling. Real-Time Systems Journal 22, 49–75 (2002)
Zabos, A., Davis, R., Burns, A., Harbour, M.G.: Spare capacity distribution using exact response-time analysis. In: 17th International Conference on Real-Time and Network Systems, pp. 97–106 (2009)
Audsley, N., Burns, A., Richardson, M., Tindell, K., Wellings, A.: Applying new scheduling theory to static priority preemptive scheduling. Software Engineering Journal 8, 284–292 (1993)
Joseph, M., Pandya, P.: Finding response times in a real-time system. BCS Computer Journal 29, 390–395 (1986)
Baruah, S.: Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling. Technical report (2010), http://www.cs.unc.edu/~baruah/Pubs.shtml
Davis, R., Rothvoss, T., Baruah, S., Burns, A.: Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling. Journal of Real Time Systems 43, 211–258 (2009)
Barhorst, J., Belote, T., Binns, P., Hoffman, J., Paunicka, J., Sarathy, P., Scoredos, J., Stanfill, P., Stuart, D., Urzi, R.: White paper: A research agenda for mixed-criticality systems (2009), http://www.cse.wustl.edu/~cdgill/CPSWEEK09_MCAR
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Burns, A., Baruah, S. (2011). Timing Faults and Mixed Criticality Systems. In: Jones, C.B., Lloyd, J.L. (eds) Dependable and Historic Computing. Lecture Notes in Computer Science, vol 6875. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24541-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-24541-1_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24540-4
Online ISBN: 978-3-642-24541-1
eBook Packages: Computer ScienceComputer Science (R0)