mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Overrun Methods for Semi-Independent Real-Time Hierarchical Scheduling
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0002-1687-930X
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0001-6132-7945
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0001-7586-0409
Dept. of Computer Science, KAIST Daejeon, South Korea.
2009 (English)Report (Other academic)
Abstract [en]

The Hierarchical Scheduling Framework (HSF) has been introduced as a design-time framework to enable compositional schedulability analysis of embedded software systems with real-time properties. In this paper a software system consists of a number of semi-independent components called subsystems. Subsystems are developed independently and later integrated to form a system. To support this design process, in the paper, the proposed methods allow non-intrusive configuration and tuning of subsystem timing-behaviour via subsystem interfaces for selecting scheduling parameters. This paper considers three methods to handle overruns due to resource sharing between subsystems in the HSF. For each one of these three overrun methods corresponding scheduling algorithms The work in this paper is supported by the Swedish Foundation for Strategic Research (SSF), via the research programme PROGRESS. and associated schedulability analysis are presented together with analysis that shows under what circumstances one or the other is preferred. The analysis is generalized to allow for both Fixed Priority Scheduling (FPS) and Earliest Deadline First (EDF) scheduling. Also, a further contribution of the paper is the technique of calculating resource-holding times within the framework under different scheduling algorithms. The resource holding times being an important parameter in the global schedulability analysis.

Place, publisher, year, edition, pages
Västerås: Mälardalen University , 2009.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:mdh:diva-8963ISRN: MDH-MRTC-237/2009-1-SEOAI: oai:DiVA.org:mdh-8963DiVA, id: diva2:301525
Funder
Swedish Foundation for Strategic Research Available from: 2010-03-03 Created: 2010-03-03 Last updated: 2014-02-04Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

http://www.es.mdh.se/pdf_publications/1345.pdf

Authority records BETA

Behnam, MorisNolte, ThomasSjödin, Mikael

Search in DiVA

By author/editor
Behnam, MorisNolte, ThomasSjödin, Mikael
By organisation
School of Innovation, Design and Engineering
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 30 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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