skip to main content
research-article

MC-ADAPT: Adaptive Task Dropping in Mixed-Criticality Scheduling

Published:27 September 2017Publication History
Skip Abstract Section

Abstract

Recent embedded systems are becoming integrated systems with components of different criticality. To tackle this, mixed-criticality systems aim to provide different levels of timing assurance to components of different criticality levels while achieving efficient resource utilization. Many approaches have been proposed to execute more lower-criticality tasks without affecting the timeliness of higher-criticality tasks. Those previous approaches however have at least one of the two limitations; i) they penalize all lower-criticality tasks at once upon a certain situation, or ii) they make the decision how to penalize lower-criticality tasks at design time. As a consequence, they under-utilize resources by imposing an excessive penalty on low-criticality tasks. Unlike those existing studies, we present a novel framework, called MC-ADAPT, that aims to minimally penalize lower-criticality tasks by fully reflecting the dynamically changing system behavior into adaptive decision making. Towards this, we propose a new scheduling algorithm and develop its runtime schedulability analysis capable of capturing the dynamic system state. Our proposed algorithm adaptively determines which task to drop based on the runtime analysis. To determine the quality of task dropping solution, we propose the speedup factor for task dropping while the conventional use of the speedup factor only evaluates MC scheduling algorithms in terms of the worst-case schedulability. We apply the speedup factor for a newly-defined task dropping problem that evaluates task dropping solution under different runtime scheduling scenarios. We derive that MC-ADAPT has a speedup factor of 1.619 for task drop. This implies that MC-ADAPT can behave the same as the optimal scheduling algorithm with optimal task dropping strategy does under any runtime scenario if the system is sped up by a factor of 1.619.

References

  1. AUTOSAR. 2005. AUTomotive open system ARchitecture. www.autosar.org. (2005).Google ScholarGoogle Scholar
  2. S. Baruah, V. Bonifaci, G. D”Angelo, H. Li, A. Marchetti-Spaccamela, S. Van der Ster, and L. 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
  3. S. K. Baruah, A. Burns, and R. I. Davis. 2011. Response-time analysis for mixed criticality systems. In Real Time System Symposium (RTSS). 34--43. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Sanjoy K. Baruah, Louis E. Rosier, and Rodney R. Howell. 1990. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Systems 2, 4 (1990), 301--324. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. I. Bate, A. Burns, and R. I. Davis. 2015. A bailout protocol for mixed criticality systems. In Euromicro Conference on Real-Time Systems (ECRTS). 259--268. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. A. Burns and S. Baruah. 2013. Towards a more practical model for mixed criticality systems. In Workshop of Mixed Criticality Systems (WMC).Google ScholarGoogle Scholar
  7. Alan Burns and Robert Davis. 2016. Mixed criticality systems -- A review. http://www-users.cs.york.ac.uk/burns/review.pdf. (2016). the seventh edition.Google ScholarGoogle Scholar
  8. A. Easwaran. 2013. Demand-based scheduling of mixed-criticality sporadic tasks on one processor. In Real Time System Symposium (RTSS). 78--87. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. P. Ekberg and Wang Yi. 2012. 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
  10. Oliver Gettings, Sophie Quinton, and Robert I. Davis. 2015. Mixed criticality systems with weakly-hard constraints. In Real-Time Networks and Systems (RTNS). 237--246. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. X. Gu and A. Easwaran. 2016. Dynamic budget management with service guarantees for mixed-criticality systems. In Real Time System Symposium (RTSS). 47--56.Google ScholarGoogle Scholar
  12. Xiaozhe Gu, A. Easwaran, Kieu-My Phan, and Insik Shin. 2015. Resource efficient isolation mechanisms in mixed-criticality scheduling. In Euromicro Conference on Real-Time Systems (ECRTS). 13--24. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Nan Guan, Pontus Ekberg, Martin Stigge, and Wang Yi. 2011. Effective and efficient scheduling of certifiable mixed-criticality sporadic task systems. In Real Time System Symposium (RTSS). 13--23. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. P. Huang, P. Kumar, N. Stoimenov, and L. Thiele. 2013. Interference constraint graph - A new specification for mixed-criticality systems. In Emerging Technologies and Factory Automation (ETFA). 1--8.Google ScholarGoogle Scholar
  15. Mathieu Jan, Lilia Zaourar, and Maurice Pitel. 2013. Maximizing the execution rate of low-criticality tasks in mixed criticality systems. In Workshop of Mixed Criticality Systems (WMC).Google ScholarGoogle Scholar
  16. Bala Kalyanasundaram and Kirk Pruhs. 2000. Speed is as powerful as clairvoyance. J. ACM 47, 4 (2000), 617--643. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Di Liu, Jelena Spasic, Nan Guan, Gang Chen, Songran Liu, Todor Stefanov, and Wang Yi. 2016. EDF-VD scheduling of mixed-criticality systems with degraded quality guarantees. In Real Time System Symposium (RTSS). 35--46.Google ScholarGoogle ScholarCross RefCross Ref
  18. P. J. Prisaznuk. 1992. Integrated modular avionics. In National Aerospace and Electronics Conference (NAECON). 39--45.Google ScholarGoogle ScholarCross RefCross Ref
  19. J. Ren and Linh Thi Xuan Phan. 2015. Mixed-criticality scheduling on multiprocessors using task grouping. In Euromicro Conference on Real-Time Systems (ECRTS). 25--34. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. F. Santy, L. George, P. Thierry, and J. Goossens. 2012. Relaxing mixed-criticality scheduling strictness for task sets scheduled with FP. In Euromicro Conference on Real-Time Systems (ECRTS). 155--165. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Hang Su and Dakai Zhu. 2013. An elastic mixed-criticality task model and its scheduling algorithm. In Design, Automation, and Test in Europe (DATE). 147--152. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. S. Vestal. 2007. Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In Real Time System Symposium (RTSS). 239--243. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. MC-ADAPT: Adaptive Task Dropping in 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!