Determining Maximum Stack Usage in Preemptive Shared Stack Systems

  • Authors:

  • Kaj Hanninen;Jukka Maki-Turja;Markus Bohlin;Jan Carlson;Mikael Nolin

  • Affiliations:

  • Malardalen Real-Time Research Centre (MRTC), Sweden/ Arcticus Systems, Sweden;Malardalen Real-Time Research Centre (MRTC), Sweden;Malardalen Real-Time Research Centre (MRTC), Sweden/ Swedish Institute of Computer Science, Sweden;Malardalen Real-Time Research Centre (MRTC), Sweden;Malardalen Real-Time Research Centre (MRTC), Sweden/ CC Systems, Sweden

  • Venue:
  • RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.