loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
27th IEEE International Real-Time Systems Symposium (RTSS'06)
Determining Maximum Stack Usage in Preemptive Shared Stack Systems
Rio de Janeiro, Brazil
December 05-December 08
ISBN: 0-7695-2761-2
ASCII Text
x 
 
Kaj Hanninen, Jukka Maki-Turja, Markus Bohlin, Jan Carlson, Mikael Nolin, "Determining Maximum Stack Usage in Preemptive Shared Stack Systems," Real-Time Systems Symposium, IEEE International, pp. 445-453, 27th IEEE International Real-Time Systems Symposium (RTSS'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/RTSS.2006.18,
author = {Kaj Hanninen and Jukka Maki-Turja and Markus Bohlin and Jan Carlson and Mikael Nolin},
title = {Determining Maximum Stack Usage in Preemptive Shared Stack Systems},
journal ={Real-Time Systems Symposium, IEEE International},
volume = {0},
year = {2006},
issn = {1052-8725},
pages = {445-453},
doi = {http://doi.ieeecomputersociety.org/10.1109/RTSS.2006.18},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Real-Time Systems Symposium, IEEE International
TI - Determining Maximum Stack Usage in Preemptive Shared Stack Systems
SN - 1052-8725
SP445
EP453
A1 - Kaj Hanninen,
A1 - Jukka Maki-Turja,
A1 - Markus Bohlin,
A1 - Jan Carlson,
A1 - Mikael Nolin,
PY - 2006
KW - null
VL - 0
JA - Real-Time Systems Symposium, IEEE International
ER -
 
Kaj Hanninen, Malardalen Real-Time Research Centre (MRTC), Sweden; Arcticus Systems, Sweden
Jukka Maki-Turja, Malardalen Real-Time Research Centre (MRTC), Sweden
Markus Bohlin, Malardalen Real-Time Research Centre (MRTC), Sweden; Swedish Institute of Computer Science, Sweden
Jan Carlson, Malardalen Real-Time Research Centre (MRTC), Sweden
Mikael Nolin, Malardalen Real-Time Research Centre (MRTC), Sweden; CC Systems, Sweden
This paper presents a novel method to determine the maximum stack memory used in preemptive, shared stack, real-time systems. We provide a general and exact problem formulation applicable for any preemptive system model based on dynamic (run-time) properties.

We also show how to safely approximate the exact stack usage by using static (compile time) information about the system model and the underlying run-time system on a relevant and commercially available system model: A hybrid, statically and dynamically, scheduled system.

Comprehensive evaluations show that our technique significantly reduces the amount of stack memory needed compared to existing analysis techniques. For typical task sets a decrease in the order of 70% is typical.

Citation:
Kaj Hanninen, Jukka Maki-Turja, Markus Bohlin, Jan Carlson, Mikael Nolin, "Determining Maximum Stack Usage in Preemptive Shared Stack Systems," rtss, pp.445-453, 27th IEEE International Real-Time Systems Symposium (RTSS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.