mdh.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Safe Shared Stack Bounds in Systems with Offsets and Precedences
Mälardalens högskola, Akademin för innovation, design och teknik.ORCID-id: 0000-0003-1597-6738
Mälardalens högskola, Akademin för innovation, design och teknik.ORCID-id: 0000-0003-0757-822X
Mälardalens högskola, Akademin för innovation, design och teknik.ORCID-id: 0000-0003-2957-0966
Mälardalens högskola, Akademin för innovation, design och teknik.ORCID-id: 0000-0002-8461-0230
Vise andre og tillknytning
2008 (engelsk)Rapport (Annet vitenskapelig)
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. 

sted, utgiver, år, opplag, sider
Mälardalen Real-Time Research Centre, Mälardalen University , 2008.
Serie
MRTC report, ISSN 1404-3041
HSV kategori
Identifikatorer
URN: urn:nbn:se:mdh:diva-7106ISRN: MDH-MRTC-221/2008-1-SEOAI: oai:DiVA.org:mdh-7106DiVA, id: diva2:237116
Tilgjengelig fra: 2009-09-25 Laget: 2009-09-25 Sist oppdatert: 2014-02-04bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Personposter BETA

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

Søk i DiVA

Av forfatter/redaktør
Bohlin, MarkusHänninen, KajMäki-Turja, JukkaCarlson, JanNolin, Mikael
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric

urn-nbn
Totalt: 55 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf