Huang-Ming Huang
Chenyang Lu
Abstract
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 scheduling policy, and estimates of tasks' worst-case execution times must be conservative in case a task runs longer than is usual. To address the significant underutilization of a system's resources under normal operating conditions that can arise from these assumptions, several mixed-criticality scheduling approaches have been proposed. However, to date, there have been few quantitative comparisons of system schedulability or runtime overhead for the different approaches.
In this article, we present a side-by-side implementation and evaluation of the known mixed-criticality scheduling approaches, for periodic and sporadic mixed-criticality tasks on uniprocessor systems, under a mixed-criticality scheduling model that is common to all these approaches. To make a fair evaluation of mixed-criticality scheduling, we also address previously open issues and propose modifications to improve particular approaches. Our empirical evaluations demonstrate that user-space implementations of mechanisms to enforce different mixed-criticality scheduling approaches can be achieved atop Linux without kernel modification, with reasonably low (but in some cases nontrivial) overhead for mixed-criticality real-time task sets.
- James H. Anderson, Sanjoy Baruah, and Björn B. Brandenburg. 2009. Multicore operating-system support for mixed criticality. In Proceedings of the Workshop on Mixed Criticality: Roadmap to Evolving UAV Certification.Google Scholar
- N. Audsley. 1991. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Tech. Rep. University of York, York, UK. November.Google Scholar
- Sanjoy Baruah and Alan Burns. 2011. Implementing mixed criticality systems in Ada. In Proceedings of the Reliable Software Technologies-Ada-Europe 2011. Google ScholarDigital Library
- Sanjoy Baruah, Alan Burns, and R. I. Davis. 2011. Response-time analysis for mixed criticality systems. In Proceedings of the Real-Time Systems Symposium. 34--43. Google ScholarDigital Library
- Sanjoy Baruah, Haohan Li, and Chapel Hill. 2010. Towards the design of certifiable mixed-criticality systems. In Proceedings of the Real-Time and Embedded Technology and Applications Symposium. IEEE Press, 13--22. Google ScholarDigital Library
- Sanjoy Baruah and Steve Vestal. 2008. Schedulability analysis of sporadic tasks with multiple criticality specifications. In Proceedings of the Euromicro Conference on Real-Time Systems. IEEE Press, 147--155. Google ScholarDigital Library
- Andrea Bastoni and B. Brandenburg. 2010. Cache-related preemption and migration delays: Empirical approximation and impact on schedulability. In Proceedings of the 6th International Workshop on Operating Systems Platforms for Embedded Real-Time Applications, 33--44.Google Scholar
- Enrico Bini and Giorgio C. Buttazzo. 2005. Measuring the performance of schedulability tests. Real-Time Syst. 30, 1--2, 129--154. Google ScholarDigital Library
- Alan Burns. 2011. Timing faults and mixed criticality systems. In Dependable and Historic Computing, Lloyd and Jones, Eds., Lecture Notes in Computer Science, vol. 6875, Springer, 147--166. Google ScholarDigital Library
- Dionisio de Niz, Karthik Lakshmanan, and Ragunathan Rajkumar. 2009. On the scheduling of mixed-criticality real-time task sets. In Proceedings of the Real-Time Systems Symposium. IEEE Press, 291--300. Google ScholarDigital Library
- N. Fisher, T. P. Baker, and S. Baruah. 2006. Algorithms for determining the demand-based load of a sporadic task system. In Proceedings of RTCSA, 135--146. Google ScholarDigital Library
- Nan Guan, Pontus Ekberg, Martin Stigge, and Wang Yi. 2011. Effective and efficient scheduling of certifiable mixed-criticality sporadic task systems. In Proceedings of the Real-Time Systems Symposium, 13--23. Google ScholarDigital Library
- Huang-Ming Huang, Christopher Gill, and Chenyang Lu. 2012. Implementation and evaluation of mixed-criticality scheduling approaches for periodic tasks. In Proceedings of the Real-Time and Embedded Technology and Applications Symposium, 23--32. Google ScholarDigital Library
- M. Joseph and P. Pandya. 1986. Finding response times in a real-time system. Comput. J. 29, 5, 390--395.Google ScholarCross Ref
- Karthik Lakshmanan, Dionisio de Niz, Ragunathan Rajkumar, and Gabriel Moreno. 2010. Resource allocation in distributed mixed-criticality cyber-physical systems. In Proceedings of the International Conference on Distributed Computing Systems. IEEE Press, 169--178. Google ScholarDigital Library
- Haohan Li and Sanjoy Baruah. 2010a. An algorithm for scheduling certifiable mixed-criticality sporadic task systems. In Proceedings of the Real-Time Systems Symposium. IEEE Press, 183--192. Google ScholarDigital Library
- Haohan Li and Sanjoy Baruah. 2010b. Load-based schedulability analysis of certifiable mixed-criticality systems. In Proceedings of the 10th ACM International Conference on Embedded Software. ACM, New York, 99--108. Google ScholarDigital Library
- Jane W. S. W. Liu. 2000. Real-Time Systems 1st Ed. Prentice-Hall, Upper Saddle River, N.J.Google Scholar
- Rodolfo Pellizzoni, Patrick Meredith, Min-Young Nam, Mu Sun, Marco Caccamo, and Lui Sha. 2009. Handling mixed-criticality in SoC-based real-time embedded systems. In Proceedings of the 7th ACM International Conference on Embedded Software. ACM, Press, New York, 235. Google ScholarDigital Library
- Steven Rostedt and Darren V. Hart. 2007. Internals of the RT patch. In Proceedings of the Linux Symposium.Google Scholar
- Lui Sha, John P. Lehoczky, and Ragunathan Rajkumar. 1986. Solutions for some practical problems. In Proceedings of the Real-Time Systems Symposium. IEEE Press, 181--191.Google Scholar
- Steve Vestal. 2007. Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In Proceedings of the Real-Time Systems Symposium. IEEE Press, 239--243. Google ScholarDigital Library
Index Terms
- Implementation and evaluation of mixed-criticality scheduling approaches for sporadic tasks
Recommendations
Corrections to and Discussion of “Implementation and Evaluation of Mixed-criticality Scheduling Approaches for Sporadic Tasks”
Special Issue on Embedded Computing for IoT, Special Issue on Big Data and Regular PapersThe AMC-IA mixed-criticality scheduling analysis was proposed as an improvement to the AMC-MAX adaptive mixed-criticality scheduling analysis. However, we have identified several necessary corrections to the AMC-IA analysis. In this article, we motivate ...
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 ...
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 ...
Comments