• DocumentCode
    2930902
  • Title

    Determining Maximum Stack Usage in Preemptive Shared Stack Systems

  • Author

    Hänninen, Kaj ; Mäki-Turja, Jukka ; Bohlin, Markus ; Carlson, Jan ; Nolin, Mikael

  • Author_Institution
    Malardalen Real-Time Res. Centre, Vasteras
  • fYear
    2006
  • fDate
    Dec. 2006
  • Firstpage
    445
  • Lastpage
    453
  • 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
  • Keywords
    real-time systems; shared memory systems; maximum stack memory; maximum stack usage; preemptive shared stack system; real-time system; Computer science; Dynamic scheduling; Job shop scheduling; Multitasking; Random access memory; Read-write memory; Real time systems; Runtime; Upper bound; Yarn;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Real-Time Systems Symposium, 2006. RTSS '06. 27th IEEE International
  • Conference_Location
    Rio de Janeiro
  • ISSN
    1052-8725
  • Print_ISBN
    0-7695-2761-2
  • Type

    conf

  • DOI
    10.1109/RTSS.2006.18
  • Filename
    4032371