You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Determining Maximum Stack Usage in Preemptive Shared Stack Systems

Fulltext:


Authors:

Kaj Hänninen, Jukka Mäki-Turja, Markus Bohlin, Jan Carlson, Mikael Sjödin

Research group:

Real-Time Systems Design

Publication Type:

Conference/Workshop Paper

Venue:

The 27th IEEE Real-Time Systems Symposium

Abstract

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.

Bibtex

@inproceedings{Hanninen982,
author = {Kaj H{\"a}nninen and Jukka M{\"a}ki-Turja and Markus Bohlin and Jan Carlson and Mikael Sj{\"o}din},
title = {Determining Maximum Stack Usage in Preemptive Shared Stack Systems},
month = {December},
year = {2006},
booktitle = {The 27th IEEE Real-Time Systems Symposium},
url = {http://www.es.mdu.se/publications/982-}
}