Timing faults and mixed criticality systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6875 LNCS, Issue , 2011, Pages 147-166

  Burns, Alan ^a   Baruah, Sanjoy ^b  

^a UNIVERSITY OF YORK   (United Kingdom)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CERTIFICATION REQUIREMENTS; EXECUTION TIME; FIXED PRIORITIES; HIGH-INTEGRITY SYSTEMS; IMPLEMENTATION SCHEME; MIXED-CRITICALITY SYSTEMS; RUNTIME MONITORING; SAFETY-CRITICAL; SAFETY-CRITICAL EMBEDDED SYSTEMS; SCHEDULABILITY; TIMING FAULT; UNIPROCESSORS; WORST-CASE EXECUTION TIME;

CRITICALITY (NUCLEAR FISSION); SAFETY ENGINEERING; STATIC ANALYSIS;

EMBEDDED SYSTEMS;

EID: 84856469180     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24541-1_12     Document Type: Conference Paper

References (22)

1. 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)
2. 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)
3. Baruah, S., Vestal, S.: Schedulability analysis of sporadic tasks with multiple criticality specifications. In: ECRTS, pp. 147-155 (2008)
4. 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)
5. S. K. Baruah, V. Bonifaci, G. D'Angelo, H. Li, A. Marchetti-Spaccamela, N. Megow, and L. Stougie. Scheduling real-time mixed-criticality jobs. In P. Hlinený and A. Kucera, editors, Proceedings of the 35th International Symposium on the Mathematical Foundations of Computer Science, Volume 6281 of Lecture Notes in Computer Science, pages 90-101. Springer,2010.
6. 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
7. 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)
8. Audsley, N.: On priority assignment in fixed priority scheduling. Information Processing Letters 79, 39-44 (2001)
9. 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)
10. 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)
11. Leung, J.,Whitehead, J.: On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation 2, 237-250 (1982)
12. 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)
13. 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)
14. Bernat, G., Burns, A.: New results on fixed priority aperiodic servers. In: Proceedings 20th IEEE Real-Time Systems Symposium, pp. 68-78 (1999)
15. Caccamo, M., Sha, L.: Aperiodic servers with resource constraints. In: Proceedings of the IEEE Real-Time Systems Symposium (2001)
16. Bernat, G., Burns, A.: Multiple servers and capacity sharing for implementing flexible scheduling. Real-Time Systems Journal 22, 49-75 (2002)
17. 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)
18. 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)
19. Joseph, M., Pandya, P.: Finding response times in a real-time system. BCS Computer Journal 29, 390-395 (1986)
20. 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
21. Davis, R., Rothvoss, T., Baruah, S., Burns, A.: Exact quantification of the suboptimality of uniprocessor fixed priority pre-emptive scheduling. Journal of Real Time Systems 43, 211-258 (2009)
22. 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 mixedcriticality systems (2009), http://www.cse.wustl.edu/~cdgill/ CPSWEEK09-MCAR