Abstract
In a mixed-criticality system, multiple tasks with different levels of criticality may coexist on the same hardware platform. The scheduling algorithm EDF-VD (Earliest Deadline First with Virtual Deadlines) has been proposed for mixed-criticality systems, which assumes tasks do not share any common resources. We present MC-SRP (Mixed-Criticality Stack Resource Policy), a resource synchronization protocol for EDF-VD, which allows resource sharing among tasks at the same criticality level and guarantees that each task is blocked at most once in each criticality mode. In addition, we present MC-SRPT (MC-SRP with Thresholds) for reducing the application stack size requirement in resource-constrained embedded systems.
- Zaid Al-bayati, Qingling Zhao, Ahmed Youssef, Haibo Zeng, and Zonghua Gu. 2015. Enhanced partitioned scheduling of Mixed-Criticality Systems on multicore platforms. In 2015 20th Asia and South Pacific Design Automation Conference (ASP-DAC’15). IEEE, 630--635.Google Scholar
- Theodore P. Baker. 1991. Stack-based scheduling of realtime processes. Real-Time Systems 3, 1, 67--99. Google Scholar
Digital Library
- Sanjoy K. Baruah. 2006. Resource sharing in EDF-scheduled systems: A closer look. In IEEE Real-Time Systems Symposium (RTSS). IEEE Computer Society, 379--387. Google Scholar
Digital Library
- Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D’Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Suzanne van der Ster, and Leen 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
- Sanjoy K. Baruah and Gerhard Fohler. 2011. Certification-cognizant time-triggered scheduling of mixed-criticality systems. In IEEE Real-Time Systems Symposium (RTSS). IEEE Computer Society, 3--12. Google Scholar
Digital Library
- Enrico Bini and Giorgio C. Buttazzo. 2005. Measuring the performance of schedulability tests. Real-Time Systems 30, 1--2, 129--154. Google Scholar
Digital Library
- Alan Burns. 2013. The application of the original priority ceiling protocol to mixed criticality systems. In Proceedings of the Workshop on Real-Time Mixed Criticality Systems (ReTiMiCS), IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA). 7--11.Google Scholar
- Alan Burns and B. Baruah. 2013. Towards a more practical model for mixed criticality systems. In Proceedings of the Workshop on Mixed Criticality Systems (WMC), IEEE Real-Time Systems Symposium (RTSS). 1--6.Google Scholar
- Alan Burns and Rob Davis. 2014. Mixed Criticality Systems - A Review. Technical Report. University of York.Google Scholar
- Giorgio C. Buttazzo. 2011. Hard Real-Time Computing Systems. Springer. Google Scholar
Digital Library
- Dionisio de Niz, Karthik Lakshmanan, and Ragunathan Rajkumar. 2009. On the scheduling of mixed-criticality real-time task sets. In IEEE Real-Time Systems Symposium (RTSS). 291--300. Google Scholar
Digital Library
- Pontus Ekberg and Wang Yi. 2012. Outstanding paper award: Bounding and shaping the demand of mixed-criticality sporadic tasks. In Euromicro Conference on Real-Time Systems (ECRTS). 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, 48--86. Google Scholar
Digital Library
- Paolo Gai, Giuseppe Lipari, and Marco Di Natale. 2001. Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip. In IEEE Real-Time Systems Symposium (RTSS). IEEE Computer Society, 73--83. Google Scholar
Digital Library
- Rony Ghattas and Alexander G. Dean. 2007. Preemption threshold scheduling: Stack optimality, enhancements and analysis. In IEEE Real-Time and Embedded Technology and Applications Symposium. IEEE Computer Society, 147--157. Google Scholar
Digital Library
- Chuancai Gu, Nan Guan, Qingxu Deng, and Wang Yi. 2014. Partitioned mixed-criticality scheduling on multiprocessor platforms. In Proceedings of the 2014 Design, Automation and Test in Europe Conference and Exhibition (DATE’14). IEEE, 1--6. Google Scholar
Digital Library
- Karthik Lakshmanan, Dionisio de Niz, and Ragunathan Rajkumar. 2011. Mixed-criticality task synchronization in zero-slack scheduling. In IEEE Real-Time and Embedded Technology and Applications Symposium. 47--56. Google Scholar
Digital Library
- Hang Su, Nan Guan, and Dakai Zhu. 2014. Service guarantee exploration for mixed-criticality systems. In 2014 IEEE 20th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA’14). IEEE, 1--10.Google Scholar
Cross Ref
- Hang Su and Dakai Zhu. 2013. An elastic mixed-criticality task model and its scheduling algorithm. In Proceedings of the Conference on Design, Automation and Test in Europe. EDA Consortium, 147--152. Google Scholar
Digital Library
- Hang Su, Dakai Zhu, and Daniel Mossé. 2013. Scheduling algorithms for elastic mixed-criticality tasks in multicore systems. In Proceedings of the 2013 IEEE 19th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA’13). IEEE, 352--357.Google Scholar
Cross Ref
- Steve Vestal. 2007. Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In IEEE Real-Time Systems Symposium (RTSS). IEEE Computer Society, 239--243. Google Scholar
Digital Library
- Yun Wang and Manas Saksena. 1999. Scheduling fixed-priority tasks with preemption threshold. In Proceedings of the 1999 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA’99). IEEE Computer Society, 328--335. Google Scholar
Digital Library
- Fengxiang Zhang and Alan Burns. 2013. Schedulability analysis of EDF-scheduled embedded real-time systems with resource sharing. ACM Transactions on Embedded Computing Systems (TECS) 12, 3, 67. Google Scholar
Digital Library
- Tianyu Zhang, Nan Guan, Qingxu Deng, and Wang Yi. 2014. On the analysis of EDF-VD scheduled mixed-criticality real-time systems. In Proceedings of the 2014 9th IEEE International Symposium on Industrial Embedded Systems (SIES’14). IEEE, 179--188.Google Scholar
- Qingling Zhao, Zonghua Gu, and Haibo Zeng. 2013. PT-AMC: Integrating preemption thresholds into mixed-criticality scheduling. In Proceedings of the Conference on Design, Automation and Test in Europe. EDA Consortium, 141--146. Google Scholar
Digital Library
- Qingling Zhao, Zonghua Gu, and Haibo Zeng. 2014. HLC-PCP: A resource synchronization protocol for certifiable mixed criticality scheduling. IEEE Embedded Systems Letters 6, 1, 8--11.Google Scholar
Cross Ref
Index Terms
Resource Synchronization and Preemption Thresholds Within Mixed-Criticality Scheduling
Recommendations
Integrating Real-Time Synchronization Schemes into Preemption Threshold Scheduling
ISORC '02: Proceedings of the Fifth IEEE International Symposium on Object-Oriented Real-Time Distributed ComputingPreemption threshold scheduling (PTS) provides prominent benefits for fixed priority scheduling such as increased schedulability, reduced context switches, and decreased memory requirements. Since such benefits of PTS allow for scalable real-time system ...
Dual ceiling protocol for real-time synchronization under preemption threshold scheduling
The application of object-oriented design methods to real-time embedded systems is seriously hindered by the lack of existing real-time scheduling techniques that can be seamlessly integrated into these methods. Preemption threshold scheduling (PTS) ...
Design optimization for AUTOSAR models with preemption thresholds and mixed-criticality scheduling
Preemption Threshold Scheduling (PTS) is an effective technique for reducing stack memory usage by selectively disabling preemption between pairs of tasks.We consider the AUTOSAR standard in automotive embedded software development, where each task ...






Comments