You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Multi-Level Adaptive Hierarchical Scheduling Framework for Composing Real-Time Systems

Fulltext:


Authors:

Nima Khalilzad, Moris Behnam, Thomas Nolte

Research group:

Complex Real-Time Embedded Systems

Publication Type:

Conference/Workshop Paper

Venue:

19th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

Abstract

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.

Bibtex

@inproceedings{Khalilzad2955,
author = {Nima Khalilzad and Moris Behnam and Thomas Nolte},
title = {Multi-Level Adaptive Hierarchical Scheduling Framework for Composing Real-Time Systems},
month = {August},
year = {2013},
booktitle = {19th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA13)},
url = {http://www.es.mdu.se/publications/2955-}
}