Multi-Level Adaptive Hierarchical Scheduling Framework for Composing Real-Time Systems
2013 (English)In: 2013 IEEE 19th International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2013, IEEE Computer Society, 2013, 320-329 p.Conference paper (Refereed)Text
Processor partitioning and hierarchical scheduling have been widely used for composing hard real-time systems on a shared hardware platform while preserving the timing requirements of the systems. Due to the safety critical nature of the hard real-time systems for deriving the sufficient partition size often conservative analysis is used. Applying the exact same analysis for deriving the partition sizes for soft real-time systems result in unnecessary processors overallocation and consequently waste of the CPU resource. In this paper, to address the problem of composing soft and hard real-time systems on a resource constrained shared hardware, we present a multi-level adaptive hierarchical scheduling framework. In our framework, we adapt the processor partition sizes of soft real-time systems according to their need at each time point by on-line monitoring their processor demand. Furthermore, we implement our adaptive framework in the Linux kernel and show the performance of our framework using a case-study.
Place, publisher, year, edition, pages
IEEE Computer Society, 2013. 320-329 p.
Computer Engineering Computer Systems
IdentifiersURN: urn:nbn:se:kth:diva-179012DOI: 10.1109/RTCSA.2013.6732233ISI: 000350345700036ScopusID: 2-s2.0-84899437516ISBN: 978-1-4799-0850-9OAI: oai:DiVA.org:kth-179012DiVA: diva2:878752
The 19th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, August 19 - 22, 2013, Taipei, Taiwan
ProjectsARROWS - Design Techniques for Adaptive Embedded Systems
QC 201512102013-09-172015-12-092015-12-10Bibliographically approved