Alejandro Masrur
ABSTRACT
We propose a probabilistic scheduling framework for the design and development of mixed-criticality systems, i.e., where tasks with different levels of criticality need to be scheduled on a shared resource. Whereas highly critical tasks normally require hard real-time guarantees, less or non-critical ones may be degraded or even temporarily discarded at runtime. We hence propose giving probabilistic (instead of deterministic) real-time guarantees on low-criticality tasks. This simplifies the analysis and reduces conservativeness on the one hand. On the other hand, probabilistic guarantees can be tuned by the designer to reach a desired level of assurance. We illustrate these and other benefits of our framework based on extensive simulations.
- N. Audsley, A. Burns, M. Richardson, K. Tindell, and A. Wellings. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal, 8(5), 1993.Google Scholar
Cross Ref
- 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 Proc. of Euromicro Conference on Real-Time Systems (ECRTS), 2012. Google ScholarDigital Library
- S. Baruah, V. Bonifaci, G. D'Angelo, A. Marchetti-Spaccamela, S. Van Der Ster, and L. Stougie. Mixed-criticality scheduling of sporadic task systems. In Proc. of European Symposium on Algorithms (ESA), 2011. Google ScholarDigital Library
- S. Baruah, A. Burns, and R. Davis. Response-time analysis for mixed criticality systems. In Proc. of Real-Time Systems Symposium (RTSS), 2011. Google ScholarDigital Library
- S. Baruah, A. Burns, and R. Davis. An extended fixed priority scheme for mixed criticality systems. In Proc. of Workshop on Real-Time Mixed Criticality Systems (ReTiMics), Aug. 2013.Google Scholar
- S. Baruah, B. Chattopadhyay, H. Li, and I. Shin. Mixed-criticality scheduling on multiprocessors. Real-Time System.tJ (RTS), 50, 2013. Google ScholarDigital Library
- E. Bini and G. Buttazzo. Measuring the performance of schedulability tests. Real-Time Systems (RTS), 30(1-2), 2005. Google ScholarDigital Library
- A. Burns and R. Davis. Adaptive mixed criticality scheduling with deferred preemption. In Proc. of Real-Time System.tJ Symposium (RTSS), Dec. 2014.Google ScholarCross Ref
- A. Burns and R. Davis. Mixed criticality systems - a review. Technical report, Department of Computer Science, University of York, 2015.Google Scholar
- P. Ekberg and W. Yi. Bounding and shaping the demand of mixed-criticality sporadic tasks. In Proc. of 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 (RTS), 50(1), 2014. Google ScholarDigital Library
- M. Hamdaoui and P. Ramanathan. A dynamic priority assignment technique for streams with (m,k)-firm deadlines. IEEE Transactions on Computers, 44(12), 1995. Google ScholarDigital Library
- P. Huang, G. Giannopoulou, N. Stoimenov, and L. Thiele. Service adaptions for mixed-criticality systems. Technical report, Computer Engineering and Networks Laboratory, ETH Zurich, 2013.Google Scholar
- P. Huang, P. Kumar, G. Giannopoulou, and L. Thiele. Run and be safe: Mixed-criticality scheduling with temporary processor speedup. In Proc. of Design, Automation and Test in Europe (DATE), March 2015. Google ScholarDigital Library
- T.-W. Kuo and A. K. Mok. Load adjustment in adaptive real-time systems. In Proc. of Real-Time Systems Symposium (RTSS), 1991.Google ScholarCross Ref
- R. Pathan. Schedulability analysis of mixed-criticality systems on multiprocessors. In Proc. of Euromicro Conference on Real-Time Systems (ECRTS), 2012. Google ScholarDigital Library
- J. Ren and L. T. X. Phan. Mixed-criticality scheduling on multiprocessors using task grouping. In Proc. of Euromicro Conference on Real-Time Systems (ECRTS), July 2015. Google ScholarDigital Library
- H. Su and D. Zhu. An elastic mixed-criticality task model and its scheduling algorithm. In Proc. of Design, Automation and Test in Europe (DATE), 2013. Google ScholarDigital Library
- S. Vestal. Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In Proc. of Real-Time Systems Symposium (RTSS), 2007. Google ScholarDigital Library
- Y. Wang and M. Saksena. Scheduling fixed-priority tasks with preemption threshold. In Proc. of Real-Time Computing Systems and Applications (RTCSA), 1999. Google ScholarDigital Library
- Q. Zhao, Z. Gu, and H. Zeng. PT-AMC: Integrating Preemption Thresholds into Mixed-Criticality Scheduling. In Proc. of Design, Automation and Test in Europe (DATE), pages 141--146, 2013. Google ScholarDigital Library
Index Terms
- A probabilistic scheduling framework for mixed-criticality systems
Recommendations
Mixed-criticality scheduling in real-time multiprocessor systems
FRUCT '18: Proceedings of the 18th Conference of Open Innovations Association FRUCTThe relevance and popularity of mixed-criticality real-time systems precipitously increase in many industrial domains. Today, mixed-criticality systems are increasingly being implemented on multicore platforms. So, one of the most actual and important ...
Implementation and evaluation of mixed-criticality scheduling approaches for sporadic tasks
Special Issue on Real-Time and Embedded Technology and Applications, Domain-Specific Multicore Computing, Cross-Layer Dependable Embedded Systems, and Application of Concurrency to System Design (ACSD'13)Traditional fixed-priority scheduling analysis for periodic and sporadic task sets is based on the assumption that all tasks are equally critical to the correct operation of the system. Therefore, every task has to be schedulable under the chosen ...
Implementation and Evaluation of Mixed-Criticality Scheduling Approaches for Periodic Tasks
RTAS '12: Proceedings of the 2012 IEEE 18th Real Time and Embedded Technology and Applications SymposiumTraditional fixed-priority scheduling analysis for periodic task sets is based on the assumption that all tasks are equally critical to the correct operation of the system. Therefore, every task has to be schedulable under the scheduling policy, and ...
Comments