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
Scheduling of Semi-Independent Real-Time Components: Overrun Methods and Resource Holding Times
Mälardalen University, School of Innovation, Design and Engineering. (PROGRESS)ORCID iD: 0000-0002-1687-930X
Mälardalen University, School of Innovation, Design and Engineering. (PROGRESS)ORCID iD: 0000-0001-6132-7945
Mälardalen University, School of Innovation, Design and Engineering.
2008 (English)In: Proceedings of the 13th IEEE International Conference on Emerging echnologies and Factory Automation (ETFA’08), 2008, p. 575-582Conference paper, Published paper (Refereed)
Abstract [en]

The Hierarchical Scheduling Framework (HSF) has been introduced as a design-time framework enabling compositional schedulability analysis of embedded software systems with real-time properties. In this paper a 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, our proposed methods allow nonintrusive configuration and tuning of subsystem timing behaviour via subsystem interfaces for selecting scheduling parameters. This paper considers two methods to handle overruns due to resource sharing between subsystems in the HSF. We present the scheduling algorithms for overruns and their associated schedulability analysis, together with analysis that shows under what circumstances one or the other overrun method is preferred. Furthermore, we show how to calculate resource-holding times within our framework.

Place, publisher, year, edition, pages
2008. p. 575-582
National Category
Computer Engineering
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:mdh:diva-1322DOI: 10.1109/ETFA.2008.4638456ISI: 000260495500099Scopus ID: 2-s2.0-56349168936ISBN: 978-1-4244-1505-2 (print)OAI: oai:DiVA.org:mdh-1322DiVA, id: diva2:37883
Conference
13th IEEE International Conference on Emerging Technologies and Factory Automation Location: Hamburg, GERMANY Date: SEP 15-18, 2008
Available from: 2008-10-15 Created: 2008-10-15 Last updated: 2018-01-12Bibliographically approved
In thesis
1. Hierarchical Real Time Scheduling and Synchronization
Open this publication in new window or tab >>Hierarchical Real Time Scheduling and Synchronization
2008 (English)Licentiate thesis, comprehensive summary (Other scientific)
Abstract [en]

 

The Hierarchical Scheduling Framework (HSF) has been introduced to enable compositional schedulability analysis and execution of embedded software systems with real-time constraints. In this thesis, we consider a system consisting of a number of semi-independent components called subsystems, and these subsystems are allowed to share logical resources. The HSF provides CPU-time to the subsystems and it guarantees that the individual subsystems respect their allocated CPU budgets. However, if subsystems are allowed to share logical resources, extra complexity with respect to analysis and run-time mechanisms is introduced. In this thesis we address three issues related to hierarchical scheduling of semi-independent subsystems. In the first part, we investigate the feasibility of implementing the hierarchical scheduling framework in a commercial operating system, and we present the detailed figures of various key properties with respect to the overhead of the implementation.

In the second part, we studied the problem of supporting shared resources in a hierarchical scheduling framework and we propose two different solutions to support resource sharing. The first proposed solution is called SIRAP, a synchronization protocol for resource sharing in hierarchically scheduled open real-time systems, and the second solution is an enhanced overrun mechanism.

In the third part, we present a resource efficient approach to minimize system load (i.e., the collective CPU requirements to guarantee the schedulability of hierarchically scheduled subsystems). Our work is motivated from a tradeoff between reducing resource locking times and reducing system load. We formulate an optimization problem that determines the resource locking times of each individual subsystem with the goal of minimizing the system load subject to system schedulability. We present linear complexity algorithms to find an optimal solution to the problem, and we prove their correctness

 

 

 

 

 

 

 

Place, publisher, year, edition, pages
Västerås: Mälardalens högskola, 2008. p. 153
Series
Mälardalen University Press Licentiate Theses, ISSN 1651-9256 ; 94
National Category
Computer Engineering
Research subject
Datavetenskap
Identifiers
urn:nbn:se:mdh:diva-1324 (URN)978-91-86135-09-6 (ISBN)
Presentation
Kappa, Västerås (English)
Opponent
Supervisors
Available from: 2008-10-15 Created: 2008-10-15 Last updated: 2018-01-12Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Behnam, MorisNolte, Thomas

Search in DiVA

By author/editor
Behnam, MorisNolte, Thomas
By organisation
School of Innovation, Design and Engineering
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 65 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