Abstract
In this article, a two-phase execution model is proposed for mixed-criticality (MC) tasks. Different from traditional MC tasks with a computation phase only, the two-phase execution model requires a memory-access phase first to fetch the instructions and data, and then computation. Theoretical foundations are first established for a schedulability test under given memory-access and computation priority assignment. Based on the established theoretical conclusions, a two-stage priority assignment algorithm, which can find the best priority assignment for both memory-access and computation phases under fixed-priority scheduling, is further developed. Extensive experiments have been conducted and the experimental results validate the effectiveness of our proposed approach.
- N. C. Audsley. 2001. On priority assignment in fixed priority scheduling. Inf. Process. Lett. 79, 1 (May 2001), 39--44. Google Scholar
Digital Library
- James Barhorst, Todd Belote, Pam Binns, Jon Hoffman, James Paunicka, Prakash Sarathy, John Scoredos, Peter Stanfill, Douglas Stuart, and Russel Urzi. 2009. Mcar white paper: A research agenda for mixed-criticality systems. In CPS Week 2009 Workshop on Mixed Criticality: Roadmap to Evolving UAV Certification 2009.Google Scholar
- S. Baruah, V. Bonifaci, G. D’Angelo, Haohan Li, A. Marchetti-Spaccamela, N. Megow, and L. Stougie. 2012a. Scheduling real-time mixed-criticality jobs. IEEE Trans. Comput. 61, 8 (2012), 1140--1152. Google Scholar
Digital Library
- S. Baruah, V. Bonifaci, G. D’Angelo, H. Li, A. Marchetti-Spaccamela, S. Van der Ster, and L. Stougie. 2012b. The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems. In Proceedings of the 24th Euromicro Conference on Real-Time Systems (ECRTS’12). 145--154. Google Scholar
Digital Library
- S. K. Baruah, A. Burns, and R. I. Davis. 2011. Response-time analysis for mixed criticality systems. In Proceedings of the IEEE 32nd Real-Time Systems Symposium (RTSS’11). 34--43. Google Scholar
Digital Library
- S. Baruah and B. Chattopadhyay. 2013. Response-time analysis of mixed criticality systems with pessimistic frequency specification. In Proceedings of the IEEE 19th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA’13). 237--246.Google Scholar
- S. Baruah and S. Vestal. 2008. Schedulability analysis of sporadic tasks with multiple criticality specifications. In Proceedings of the Euromicro 2008 Conference on Real-Time Systems (ECRTS’08). 147--155. Google Scholar
Digital Library
- Enrico Bini and Giorgio C. Buttazzo. 2005. Measuring the performance of schedulability tests. Real-Time Systems 30, 1–2 (2005), 129--154. Google Scholar
Digital Library
- A. Burns and R. I. Davis. 2013. Mixed Criticality Systems: A Review. Technical Report MCC-1(b). Department of Computer Science, University of York, East Lansing, MI.Google Scholar
- G. C. Buttazzo, G. Lipari, and L. Abeni. 1998. Elastic task model for adaptive rate control. In Proceedings of the 19th IEEE Real-Time Systems Symposium (RTSS’98). 286--295. Google Scholar
Digital Library
- D. de Niz, K. Lakshmanan, and R. Rajkumar. 2009. On the scheduling of mixed-criticality real-time task sets. In Proceedings of the 30th IEEE Real-Time Systems Symposium (RTSS’09). 291--300. Google Scholar
Digital Library
- P. Ekberg and Wang Yi. 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). 135--144. Google Scholar
Digital Library
- Pontus Ekberg and Wang Yi. 2014. Bounding and shaping the demand of generalized mixed-criticality sporadic task systems. Real-Time Systems 50, 1 (2014), 48--86. Google Scholar
Digital Library
- Mathai Joseph and Paritosh K. Pandya. 1986. Finding response times in a real-time system. Comput. J. 29, 5 (1986), 390--395.Google Scholar
Cross Ref
- Wataru Kaneko, Kenji Kono, and Kentaro Shimizu. 2003. Preemptive resource management: Defending against resource monopolizing dos. Applied Informatics, vol 21, 662--669.Google Scholar
- Z. Li, S. Ren, and G. Quan. 2014. Dynamic reservation-based mixed-criticality task set scheduling. In High Performance Computing and Communications, Proceedings of the IEEE 6th International Symposium on Cyberspace Safety and Security, 2014 IEEE 11th International Conference on Embedded Software and Systems (HPCC, CSS, ICESS’14). 603--610. Google Scholar
Digital Library
- Zheng Li and Li Wang. 2016. Memory-aware scheduling for mixed-criticality systems. In Proceedings of the 16th International Conference on Computational Science and Its Applications (ICCSA’16). Springer International.Google Scholar
Cross Ref
- Z. Li, N. Wu, and M. Zhou. 2012. Deadlock control of automated manufacturing systems based on petri nets;a literature review. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) 42, 4 (July 2012), 437--462. Google Scholar
Digital Library
- G. Lipari and G. C. Buttazzo. 2013. Resource reservation for mixed criticality systems. In Proceedings of the Workshop on Real-Time Systems: The Past, the Present, and the Future. 60--74.Google Scholar
- C. L. Liu and James W. Layland. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20, 1 (Jan. 1973), 46--61. Google Scholar
Digital Library
- D. Liu, J. Spasic, N. Guan, G. Chen, S. Liu, T. Stefanov, and W. Yi. 2016. EDF-VD scheduling of mixed-criticality systems with degraded quality guarantees. In Proceedings of the 2016 IEEE Real-Time Systems Symposium (RTSS’16). 35--46.Google Scholar
- Alessandra Melani, Marko Bertogna, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, and Giorgio Buttazzo. 2015. Memory-processor co-scheduling in fixed priority systems. In Proceedings of the 23rd International Conference on Real Time and Networks Systems (RTNS’15). ACM, New York, NY, 87--96. Google Scholar
Digital Library
- A. Melani, M. Bertogna, R. Davis, V. Bonifaci, A. Marchetti-Spaccamela, and G. Buttazzo. 2016. Exact response time analysis for fixed priority memory-processor co-scheduling. IEEE Trans. Comput. PP, 99 (2016), 1. Google Scholar
Digital Library
- Taeju Park and Soontae Kim. 2011. Dynamic scheduling algorithm and its schedulability analysis for certifiable dual-criticality systems. In Proceedings of the 9th ACM International Conference on Embedded Software (EMSOFT’11). ACM, New York, NY, 253--262. Google Scholar
Digital Library
- Hang Su and Dakai Zhu. 2013. An elastic mixed-criticality task model and its scheduling algorithm. In Proceedings of the 2013 Design, Automation Test in Europe Conference Exhibition (DATE’13). 147--152. Google Scholar
Digital Library
- Steve Vestal. 2007. Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In Proceedings of the 28th IEEE International Real-Time Systems Symposium (RTSS’07). 239--243. Google Scholar
Digital Library
- Oreste Villa, Gianluca Palermo, and Cristina Silvano. 2008. Efficiency and scalability of barrier synchronization on NoC based many-core architectures. In Proceedings of the 2008 International Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES’08). ACM, New York, NY, 81--90. Google Scholar
Digital Library
- Qingling Zhao, Zonghua Gu, and Haibo Zeng. 2015. Resource synchronization and preemption thresholds within mixed-criticality scheduling. ACM Trans. Embed. Comput. Syst. 14, 4 (2015), 81. Google Scholar
Digital Library
Index Terms
Fixed-Priority Scheduling for Two-Phase Mixed-Criticality Systems
Recommendations
Generalizing fixed-priority scheduling for better schedulability in mixed-criticality systems
The design of mixed-criticality systems is often subject to mandatory certification and has been drawing considerable attention over the past few years. This letter studies fixed-priority scheduling of mixed-criticality systems on a uniprocessor ...
On Partitioned Scheduling of Fixed-Priority Mixed-Criticality Task Sets
TRUSTCOM '11: Proceedings of the 2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and CommunicationsMixed-criticality real-time systems, where tasks may be associated with different criticality and assurance levels, have attracted much attention in the recent past. In this paper, we consider partitioning-based multiprocessor scheduling of mixed-...
An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
The current literature of fixed-priority scheduling algorithms relies on sufficient tests to determine if a set of mixed-criticality sporadic tasks is schedulable on a single processor. The drawback of these safe tests is their pessimism, a matter that ...






Comments