Biao Hu
ABSTRACT
In mixed-criticality scheduling, the widely assumed mode-switch scheme assumes that both high- and low-criticality tasks are schedulable when no tasks overrun (normal mode) and all high-criticality tasks are schedulable even when they overrun (critical mode, where low-criticality tasks are abandoned/degraded). However, this scheme triggers a mode-switch immediately after any task overruns, which can be abrupt and pessimistic. In this paper, we tackle dual-criticality systems scheduled by earliest-deadline-first, and propose light-weight mode-switch schemes that are effective in keeping the system "away" from the critical mode. Our main idea is to perform overrun budgeting for all tasks as a whole, by monitoring task executions and updating a common overrun budget. This way, the overrun budget is shared among all tasks, and adaptively replenished leveraging run-time information; consequently, mode-switch can be postponed as much as possible. Experimental results demonstrate that the proposed mode-switch schemes outperform existing solutions to a large extent, in reducing the abandoned jobs and mode-switch frequencies, as well as in increasing the time ratio that all tasks are scheduled in the system.
- M. A. Awan and S. M. Petters. Enhanced race-to-halt: A leakage-aware energy management approach for dynamic priority systems. In Real-Time Systems (ECRTS), 2011. Google Scholar
Digital Library
- S. Baruah, V. Bonifaci, G. D'Angelo, H. Li, A. Marchetti-Spaccamela, S. Van Der Ster, and L. Stougie. The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems. In Euromicro Conference on Real-Time Systems (ECRTS), 2012. Google ScholarDigital Library
- S. K. Baruah, A. Burns, and R. I. Davis. Response-time analysis for mixed criticality systems. In Real-Time Systems Symposium (RTSS), 2011. Google ScholarDigital Library
- S. K. Baruah, A. K. Mok, and L. E. Rosier. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Real-Time Systems Symposium (RTSS), 1990.Google ScholarCross Ref
- I. Bate and A. Burns. An integrated approach to scheduling in safety-critical embedded control systems. Real-Time Systems, 25(1):5--37, 2003. Google ScholarDigital Library
- I. Bate, A. Burns, and R. I. Davis. A bailout protocol for mixed criticality systems. In Euromicro Conference on Real-Time Systems (ECRTS), 2015. Google ScholarDigital Library
- H. Biao, H. Kai, C. Gang, C. Long, and K. Alois. Adaptive runtime shaping for mixed-criticality systems. In Conference on Embedded Software (EMSOFT), 2015. Google ScholarDigital Library
- E. Bini and G. C. Buttazzo. Measuring the performance of schedulability tests. Real-Time Systems, 30(1--2):129--154, 2005. Google ScholarDigital Library
- E. Bini, M. Di Natale, and G. Buttazzo. Sensitivity analysis for fixed-priority real-time systems. Real-Time Systems, 39(1--3):5--30, 2008. Google ScholarDigital Library
- A. Burns and S. Baruah. Timing faults and mixed criticality systems. Springer, 2011.Google ScholarCross Ref
- A. Burns and S. Baruah. Towards a more practical model for mixed criticality systems. In Workshop on Mixed-Criticality Systems (colocated with RTSS), 2013.Google Scholar
- A. Burns and R. Davis. Mixed criticality systems: A review. University of York, Tech. Rep, 2015.Google Scholar
- A. Easwaran. Demand-based scheduling of mixed-criticality sporadic tasks on one processor. In Real-Time Systems Symposium (RTSS), 2013. Google ScholarDigital Library
- P. Ekberg and W. Yi. Outstanding paper award: Bounding and shaping the demand of mixed-criticality sporadic tasks. In Euromicro Conference on Real-Time Systems (ECRTS), 2012. Google ScholarDigital Library
- P. Ekberg and W. Yi. Bounding and shaping the demand of generalized mixed-criticality sporadic task systems. Real-time systems, 50(1):48--86, 2014. Google ScholarDigital Library
- B. Hu, K. Huang, G. Chen, L. Cheng, and A. Knoll. Adaptive workload management for mixed-criticality systems. ACM Transactions in Embedded Computing Systems, 2016.Google ScholarDigital Library
- B. Hu, K. Huang, G. Chen, L. Cheng, and A. Knoll. Evaluation and improvements of runtime monitoring methods for real-time event streams. ACM Transactions in Embedded Computing Systems, 2016. Google ScholarDigital Library
- B. Hu, K. Huang, G. Chen, and A. Knoll. Evaluation of runtime monitoring methods for real-time event streams. 2015.Google Scholar
- K. Huang, L. Santinelli, J.-J. Chen, L. Thiele, and G. C. Buttazzo. Adaptive dynamic power management for hard real-time systems. In Real-Time Systems Symposium (RTSS), 2009. Google ScholarDigital Library
- K. Huang, L. Santinelli, J.-J. Chen, L. Thiele, and G. C. Buttazzo. Applying real-time interface and calculus for dynamic power management in hard real-time systems. Real-Time Systems, 47(2):163--193, 2011. Google ScholarDigital Library
- J.-Y. Le Boudec and P. Thiran. Network calculus: a theory of deterministic queuing systems for the internet. Springer, 2001. Google ScholarDigital Library
- Y.-H. Lee, K. P. Reddy, and C. M. Krishna. Scheduling techniques for reducing leakage power in hard real-time systems. In Euromicro Conference on Real-Time Systems (ECRTS), 2003.Google Scholar
- R. RTCA-DO-178B. Software considerations in airborne systems and equipment certification. In Radio Technical Commission for Aeronautics (RTCA), 1992.Google Scholar
- F. Santy, L. George, P. Thierry, and J. Goossens. Relaxing mixed-criticality scheduling strictness for task sets scheduled with fp. In Euromicro Conference on Real-Time Systems (ECRTS), 2012. Google ScholarDigital Library
- S. Vestal. Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In Real-Time Systems Symposium (RTSS), 2007. Google ScholarDigital Library
Recommendations
The schedulability region of two-level mixed-criticality systems based on EDF-VD
DATE '14: Proceedings of the conference on Design, Automation & Test in EuropeThe algorithm Earliest Deadline First with Virtual Deadlines (EDF-VD) was recently proposed to schedule mixed-criticality task sets consisting of high-criticality (HI) and low-criticality (LO) tasks. EDF-VD distinguishes between HI and LO mode. In HI ...
Criticality-Aware EDF Scheduling for Constrained-Deadline Imprecise Mixed-Criticality Systems
EDF-VD first focuses on the classic mixed-criticality task model in which all low-criticality (LO) tasks are abandoned in the high-criticality mode, which is an effective dynamic priority scheduling algorithm for mixed-criticality systems. However, it has ...
Mixed-Criticality Scheduling on Multiprocessors Using Task Grouping
ECRTS '15: Proceedings of the 2015 27th Euromicro Conference on Real-Time SystemsReal-time systems are increasingly running a mix of tasks with different criticality levels: for instance, unmanned aerial vehicle has multiple software functions with different safety criticality levels, but runs them on a single, shared computational ...
Comments