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
Global schedulability analysis of a synchronization protocol based on replenishment-bounded overrun for compositional real-time systems
Mälardalen University, School of Innovation, Design and Engineering. Eindhoven University of Technology, Eindhoven, Netherlands .
Eindhoven University of Technology, Eindhoven, Netherlands . (IS (Embedded Systems))ORCID iD: 0000-0001-6234-5117
2012 (English)In: 7th IEEE International Symposium on Industrial Embedded Systems, SIES 2012 - Conference Proceedings, 2012, 39-47 p.Conference paper, Published paper (Refereed)
Abstract [en]

Hierarchical scheduling frameworks (HSFs) provide means for composing complex real-time systems from well-defined independently developed and analyzed subsystems. To support shared logical resources requiring mutual exclusive access in two-level HSFs, overrun without payback has been proposed as a mechanism to prevent budget depletion during resource access arbitrated by the stack resource policy (SRP). The same mechanism can be applied to support scheduling techniques, such as fixed-priority scheduling with deferred preemption (FPDS), that aim at a reduction of the architecture-related preemption costs and may improve the feasibility of a system. Whereas the blocking times and overrun budgets for shared logical resources will typically be much smaller than the normal budget, these values may significantly increase for scheduling techniques such as FPDS. In this paper, we therefor consider replenishment-bounded overrun, i.e. the overrun ends upon a replenishment, because the normal budget becomes available again, which allows for larger overrun budgets. We show that the global schedulability analysis for this special kind of overrun has a number of anomalies: (i) the usual theorem for critical instant does not hold, (ii) maximal blocking does not necessarily lead to a maximal response time, and (iii) it is not sufficient to analyse a fixed amount of time (say, a number of hyperperiods). We present analysis for two subsystems.

Place, publisher, year, edition, pages
2012. 39-47 p.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:mdh:diva-23575DOI: 10.1109/SIES.2012.6356568Scopus ID: 2-s2.0-84871541202ISBN: 9781467326841 (print)OAI: oai:DiVA.org:mdh-23575DiVA: diva2:679724
Conference
7th IEEE International Symposium on Industrial Embedded Systems, SIES 2012; Karlsruhe; Germany; 20 June 2012 through 22 June 2012
Available from: 2013-12-16 Created: 2013-12-16 Last updated: 2013-12-19Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Bril, Reinder J.
By organisation
School of Innovation, Design and Engineering
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 7 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