Abstract
Recent embedded systems are becoming integrated systems with components of different criticality. To tackle this, mixed-criticality systems aim to provide different levels of timing assurance to components of different criticality levels while achieving efficient resource utilization. Many approaches have been proposed to execute more lower-criticality tasks without affecting the timeliness of higher-criticality tasks. Those previous approaches however have at least one of the two limitations; i) they penalize all lower-criticality tasks at once upon a certain situation, or ii) they make the decision how to penalize lower-criticality tasks at design time. As a consequence, they under-utilize resources by imposing an excessive penalty on low-criticality tasks. Unlike those existing studies, we present a novel framework, called MC-ADAPT, that aims to minimally penalize lower-criticality tasks by fully reflecting the dynamically changing system behavior into adaptive decision making. Towards this, we propose a new scheduling algorithm and develop its runtime schedulability analysis capable of capturing the dynamic system state. Our proposed algorithm adaptively determines which task to drop based on the runtime analysis. To determine the quality of task dropping solution, we propose the speedup factor for task dropping while the conventional use of the speedup factor only evaluates MC scheduling algorithms in terms of the worst-case schedulability. We apply the speedup factor for a newly-defined task dropping problem that evaluates task dropping solution under different runtime scheduling scenarios. We derive that MC-ADAPT has a speedup factor of 1.619 for task drop. This implies that MC-ADAPT can behave the same as the optimal scheduling algorithm with optimal task dropping strategy does under any runtime scenario if the system is sped up by a factor of 1.619.
- AUTOSAR. 2005. AUTomotive open system ARchitecture. www.autosar.org. (2005).Google Scholar
- S. Baruah, V. Bonifaci, G. D”Angelo, H. Li, A. Marchetti-Spaccamela, S. Van der Ster, and L. Stougie. 2012. The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems. In Euromicro Conference on Real-Time Systems (ECRTS). 145--154. Google Scholar
Digital Library
- S. K. Baruah, A. Burns, and R. I. Davis. 2011. Response-time analysis for mixed criticality systems. In Real Time System Symposium (RTSS). 34--43. Google Scholar
Digital Library
- Sanjoy K. Baruah, Louis E. Rosier, and Rodney R. Howell. 1990. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Systems 2, 4 (1990), 301--324. Google Scholar
Digital Library
- I. Bate, A. Burns, and R. I. Davis. 2015. A bailout protocol for mixed criticality systems. In Euromicro Conference on Real-Time Systems (ECRTS). 259--268. Google Scholar
Digital Library
- A. Burns and S. Baruah. 2013. Towards a more practical model for mixed criticality systems. In Workshop of Mixed Criticality Systems (WMC).Google Scholar
- Alan Burns and Robert Davis. 2016. Mixed criticality systems -- A review. http://www-users.cs.york.ac.uk/burns/review.pdf. (2016). the seventh edition.Google Scholar
- A. Easwaran. 2013. Demand-based scheduling of mixed-criticality sporadic tasks on one processor. In Real Time System Symposium (RTSS). 78--87. Google Scholar
Digital Library
- P. Ekberg and Wang Yi. 2012. Bounding and shaping the demand of mixed-criticality sporadic tasks. In Euromicro Conference on Real-Time Systems (ECRTS). 135--144. Google Scholar
Digital Library
- Oliver Gettings, Sophie Quinton, and Robert I. Davis. 2015. Mixed criticality systems with weakly-hard constraints. In Real-Time Networks and Systems (RTNS). 237--246. Google Scholar
Digital Library
- X. Gu and A. Easwaran. 2016. Dynamic budget management with service guarantees for mixed-criticality systems. In Real Time System Symposium (RTSS). 47--56.Google Scholar
- Xiaozhe Gu, A. Easwaran, Kieu-My Phan, and Insik Shin. 2015. Resource efficient isolation mechanisms in mixed-criticality scheduling. In Euromicro Conference on Real-Time Systems (ECRTS). 13--24. Google Scholar
Digital Library
- Nan Guan, Pontus Ekberg, Martin Stigge, and Wang Yi. 2011. Effective and efficient scheduling of certifiable mixed-criticality sporadic task systems. In Real Time System Symposium (RTSS). 13--23. Google Scholar
Digital Library
- P. Huang, P. Kumar, N. Stoimenov, and L. Thiele. 2013. Interference constraint graph - A new specification for mixed-criticality systems. In Emerging Technologies and Factory Automation (ETFA). 1--8.Google Scholar
- Mathieu Jan, Lilia Zaourar, and Maurice Pitel. 2013. Maximizing the execution rate of low-criticality tasks in mixed criticality systems. In Workshop of Mixed Criticality Systems (WMC).Google Scholar
- Bala Kalyanasundaram and Kirk Pruhs. 2000. Speed is as powerful as clairvoyance. J. ACM 47, 4 (2000), 617--643. Google Scholar
Digital Library
- Di Liu, Jelena Spasic, Nan Guan, Gang Chen, Songran Liu, Todor Stefanov, and Wang Yi. 2016. EDF-VD scheduling of mixed-criticality systems with degraded quality guarantees. In Real Time System Symposium (RTSS). 35--46.Google Scholar
Cross Ref
- P. J. Prisaznuk. 1992. Integrated modular avionics. In National Aerospace and Electronics Conference (NAECON). 39--45.Google Scholar
Cross Ref
- J. Ren and Linh Thi Xuan Phan. 2015. Mixed-criticality scheduling on multiprocessors using task grouping. In Euromicro Conference on Real-Time Systems (ECRTS). 25--34. Google Scholar
Digital Library
- F. Santy, L. George, P. Thierry, and J. Goossens. 2012. Relaxing mixed-criticality scheduling strictness for task sets scheduled with FP. In Euromicro Conference on Real-Time Systems (ECRTS). 155--165. Google Scholar
Digital Library
- Hang Su and Dakai Zhu. 2013. An elastic mixed-criticality task model and its scheduling algorithm. In Design, Automation, and Test in Europe (DATE). 147--152. Google Scholar
Digital Library
- S. Vestal. 2007. Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In Real Time System Symposium (RTSS). 239--243. Google Scholar
Digital Library
Index Terms
MC-ADAPT: Adaptive Task Dropping in Mixed-Criticality Scheduling
Recommendations
Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
This paper examines the relative effectiveness of fixed priority pre-emptive scheduling in a uniprocessor system, compared to an optimal algorithm such as Earliest Deadline First (EDF).
The quantitative metric used in this comparison is the processor ...
Controlling Preemption for Better Schedulability in Multi-Core Systems
RTSS '12: Proceedings of the 2012 IEEE 33rd Real-Time Systems SymposiumInterest in real-time multiprocessor scheduling has been rekindled as multi-core chips are increasingly used for embedded real-time systems. While tasks may be preemptive or non-preemptive (due to their transactional operations), deadline guarantees are ...
Partitioned Fixed-Priority Preemptive Scheduling for Multi-core Processors
ECRTS '09: Proceedings of the 2009 21st Euromicro Conference on Real-Time SystemsEnergy and thermal considerations are increasingly driving system designers to adopt multi-core processors. In this paper, we consider the problem of scheduling periodic real-time tasks on multi-core processors using fixed-priority preemptive ...






Comments