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
Safe Shared Stack Bounds in Systems with Offsets and Precedences
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0003-1597-6738
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0003-0757-822X
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0003-2957-0966
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0002-8461-0230
Show others and affiliations
2008 (English)Report (Other academic)
Abstract [en]

The paper presents two novel methods to bound the stack memory used in preemptive, shared stack, real-time systems. The first method is based on branch-and-bound search for possible preemption patterns, and the second one approximates the first in polynomial time. The work extends previous methods by considering a more general taskmodel, in which all tasks can share the same stack. In addition, the new methods account for precedence and offset relations. Thus, the methods give tight bounds for a large set of realistic systems. The methods have been implemented and a comprehensive evaluation, comparing our new methods against each other and against existing methods, is presented. The evaluation shows that our exact method can significantly reduce the amount of stack memory needed. In our simulations, a decrease in the order of 40% was typical, with a runtime in the order of seconds. Our polynomial approximation consequently yields about 20% higher bound than the exact method. 

Place, publisher, year, edition, pages
Mälardalen Real-Time Research Centre, Mälardalen University , 2008.
Series
MRTC report, ISSN 1404-3041
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:mdh:diva-7106ISRN: MDH-MRTC-221/2008-1-SEOAI: oai:DiVA.org:mdh-7106DiVA, id: diva2:237116
Available from: 2009-09-25 Created: 2009-09-25 Last updated: 2014-02-04Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records BETA

Bohlin, MarkusHänninen, KajMäki-Turja, JukkaCarlson, JanNolin, Mikael

Search in DiVA

By author/editor
Bohlin, MarkusHänninen, KajMäki-Turja, JukkaCarlson, JanNolin, 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: 32 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