Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Towards Adaptive Hierarchical Scheduling of Real-Time Systems
Mälardalen University, Sweden.ORCID iD: 0000-0003-2670-3022
Mälardalens högskola, Akademin för innovation, design och teknik.ORCID iD: 0000-0001-6132-7945
Mälardalens högskola, Akademin för innovation, design och teknik.ORCID iD: 0000-0002-1687-930X
Mälardalens högskola, Akademin för innovation, design och teknik.ORCID iD: 0000-0001-6157-5199
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, Published paper (Refereed)
Resource type
Text
Abstract [en]

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.
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-179021DOI: 10.1109/ETFA.2011.6059019ISI: 000297542900046Scopus ID: 2-s2.0-80655132167ISBN: 978-1-4577-0018-7 (print)OAI: oai:DiVA.org:kth-179021DiVA: diva2:878746
Conference
16th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA) Location: Toulouse, FRANCE Date: SEP 05-09, 2011
Note

QC 20151210

Available from: 2011-12-15 Created: 2015-12-09 Last updated: 2015-12-10Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Moghaddami Khalilzad, NimaNolte, ThomasBehnam, MorisÅsberg, Mikael

Search in DiVA

By author/editor
Moghaddami Khalilzad, NimaNolte, ThomasBehnam, MorisÅsberg, Mikael
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 13 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf