Towards Adaptive Hierarchical Scheduling of Real-Time Systems
2011 (English)In: IEEE Symposium on Emerging Technologies and Factory Automation, ETFA, 2011 / [ed] Mammeri, Z., New York: IEEE , 2011, 1-8 p.Conference paper (Refereed)Text
Hierarchical scheduling provides a modular framework for integrating, scheduling and guaranteeing timing constraints of compositional real-time systems. In such a scheduling framework, all modules should receive a sufficient portion of the shared CPU to be able to guarantee timing constraints of their internal parts. In dynamic systems i.e., systems where the execution time of tasks are subjected to sudden and drastic changes during run-time, assigning fixed CPU portions to the modules is conducive to either low CPU utilization or numerous task deadline misses. In this paper, in order to address this problem, we propose an adaptive CPU allocation method which dynamically assigns CPU portions to the modules during run-time based on their current CPU demand. Besides, the presented approach is evaluated using a series of different simulations. In addition, we present a method for scheduling modules in situations when the CPU resource is not sufficient for scheduling all modules. We introduce the notion of module (subsystem) criticality, and in an overload situation we distribute the CPU resource based on the criticality of modules.
Place, publisher, year, edition, pages
New York: IEEE , 2011. 1-8 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-179021DOI: 10.1109/ETFA.2011.6059019ISI: 000297542900046ScopusID: 2-s2.0-80655132167ISBN: 978-1-4577-0018-7OAI: oai:DiVA.org:kth-179021DiVA: diva2:878746
16th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA) Location: Toulouse, FRANCE Date: SEP 05-09, 2011
QC 201512102011-12-152015-12-092015-12-10Bibliographically approved