skip to main content
research-article

Resource Synchronization and Preemption Thresholds Within Mixed-Criticality Scheduling

Published:20 October 2015Publication History
Skip Abstract Section

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.

References

  1. 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 ScholarGoogle Scholar
  2. Theodore P. Baker. 1991. Stack-based scheduling of realtime processes. Real-Time Systems 3, 1, 67--99. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  6. Enrico Bini and Giorgio C. Buttazzo. 2005. Measuring the performance of schedulability tests. Real-Time Systems 30, 1--2, 129--154. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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 ScholarGoogle Scholar
  8. 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 ScholarGoogle Scholar
  9. Alan Burns and Rob Davis. 2014. Mixed Criticality Systems - A Review. Technical Report. University of York.Google ScholarGoogle Scholar
  10. Giorgio C. Buttazzo. 2011. Hard Real-Time Computing Systems. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  12. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  13. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  14. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  15. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  16. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  17. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  18. 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 ScholarGoogle ScholarCross RefCross Ref
  19. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  20. 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 ScholarGoogle ScholarCross RefCross Ref
  21. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  22. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  23. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  24. 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 ScholarGoogle Scholar
  25. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  26. 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 ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Resource Synchronization and Preemption Thresholds Within Mixed-Criticality Scheduling

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!