×

Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems. (English) Zbl 1333.68074


MSC:

68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
PDFBibTeX XMLCite
Full Text: DOI HAL

References:

[1] K. Albers and F. Slomka. 2004. An event stream driven approximation for the analysis of real-time systems. In Proceedings of the 16th Euromicro Conference on Real-Time Systems. IEEE, Los Alamitos, CA, 187–195. · doi:10.1109/EMRTS.2004.1311020
[2] J. Barhorst, T. Belote, P. Binns, J. Hoffman, J. Paunicka, P. Sarathy, J. S. P. Stanfill, D. Stuart, and R. Urzi. 2009. A research agenda for mixed-criticality systems. White paper. http://www.cse.wustl.edu/∼cdgill/CPSWEEK09_MCAR/.
[3] S. K. Baruah, V. Bonifaci, G. D’Angelo, H. Li, A. Marchetti-Spaccamela, N. Megow, and L. Stougie. 2012. Scheduling real-time mixed-criticality jobs. IEEE Trans. Comput. 61, 8, 1140–1152. · Zbl 1365.90132 · doi:10.1109/TC.2011.142
[4] S. K. Baruah, R. R. Howell, and L. E. Rosier. 1993. Feasibility problems for recurring tasks on one processor. Theor. Comput. Sci. 118, 1, 3–20. · Zbl 0781.68029 · doi:10.1016/0304-3975(93)90360-6
[5] S. K. Baruah, H. Li, and L. Stougie. 2010a. Mixed-Criticality scheduling: Improved resource-augmentation results. In Proceedings of the ISCA International Conference on Computers and their Applications. ISCA, Los Alamitos, CA, 217–223.
[6] S. K. Baruah, H. Li, and L. Stougie. 2010b. Towards the design of certifiable mixed-criticality systems. In Proceedings of the 16th IEEE Real-Time Technology and Applications Symposium. IEEE, Los Alamitos, CA, 13–22. · doi:10.1109/RTAS.2010.10
[7] P. Belotti, J. Lee, L. Liberti, F. Margot, and A. Wächter. 2009. Branching and bounds tightening techniques for non-convex MINLP. Optimi. Meth. Softw. 24, 4–5, 597–634. · Zbl 1179.90237
[8] S. Boyd and L. Vandenberghe. 2009. Convex Optimization. Cambridge University Press, Cambridge, UK. · Zbl 1058.90049
[9] A. Burns and R. I. Davis. 2013. Mixed criticality systems - A Review. http://www-users.cs.york.ac.uk/∼burns/review.pdf.
[10] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. 2009. Introduction to Algorithms 3rd Ed. MIT Press, Cambridge, MA. · Zbl 1187.68679
[11] M. L. Dertouzos. 1974. Control robotics: The procedural control of physical processes. In Proceedings of the International Federation for Information Processing Congress. North-Holland, Amsterdam, 807–813.
[12] A. Easwaran. 2013. Demand-based scheduling of mixed-criticality sporadic tasks on one processor. In Proceedings of 34th IEEE Real-Time Systems Symposium. IEEE, Los Alamitos, CA, 78–87. · doi:10.1109/RTSS.2013.16
[13] P. Ekberg and W. Yi. 2012. Bounding and shaping the demand of mixed-criticality sporadic tasks. In Proceedings of 24th Euromicro Conference on Real-Time Systems. IEEE, Los Alamitos, CA, 135–144.
[14] P. Ekberg and W. Yi. 2014. Bounding and shaping the demand of generalized mixed-criticality sporadic task systems. Real-Time Systems 50, 1, 48–86. · Zbl 1291.68075 · doi:10.1007/s11241-013-9187-z
[15] N. Guan, P. Ekberg, M. Stigge, and W. Yi. 2011. Effective and efficient scheduling of certifiable mixed-criticality sporadic task systems. In Proceedings of the 32nd IEEE Real-Time Systems Symposium. IEEE, Los Alamitos, CA, 13–23. · doi:10.1109/RTSS.2011.10
[16] J. Y.-T. Leung and J. Whitehead. 1982. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Perf. Eval. 2, 4, 237–250. · Zbl 0496.90046 · doi:10.1016/0166-5316(82)90024-4
[17] H. Li and S. K. Baruah. 2010. An algorithm for scheduling certifiable mixed-criticality sporadic task systems. In Proceedings of the 31st IEEE Real-Time Systems Symposium. IEEE, Los Alamitos, CA, 183–192. · doi:10.1109/RTSS.2010.18
[18] C. L. Liu and J. W. Layland. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20, 1, 46–61. · Zbl 0265.68013 · doi:10.1145/321738.321743
[19] A. K. Mok. 1983. Fundamental design problems of distributed systems for the hard real-time environment. Ph.D. dissertation. Laboratory for Computer Science, Massachusetts Institute of Technology. (Available Technical Report No. MIT/LCS/TR-297.)
[20] A. K. Mok. 1988. Task management techniques for enforcing ED scheduling on periodic task set. In Proceedings of the 5th IEEE Workshop on Real-Time Software and Operating Systems. USENIX Association, Washington, DC, 42–46.
[21] P. J. Prisaznuk. 1992. Integrated modular avionics. In Proceedings of the IEEE National Aerospace and Electronics Conference, Vol. 1. IEEE, Los Alamitos, CA, 39–45. · doi:10.1109/NAECON.1992.220669
[22] H. Su and D. Zhu. 2013. An elastic mixed-criticality task model and its scheduling algorithm. In Proceedings of the Conference on Design, Automation & Test in Europe. EDA Consortium, San Jose, CA, 147–152. · doi:10.7873/DATE.2013.043
[23] S. Vestal. 2007. Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In Proceedings of the 28th IEEE Real-Time Systems Symposium. IEEE, Los Alamitos, CA, 239–243. · doi:10.1109/RTSS.2007.47
[24] R. Wilhelm, J. Engblom, A. Ermedahl, N. Holsti, S. Thesing, D. B. Whalley, G. Bernat, C. Ferdinand, R. Heckmann, T. Mitra, et al. 2008. The worst-case execution-time problem - overview of methods and survey of tools. ACM Trans. Embedded Comput. Syst. 7, 3, 36.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.