Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/RTSS.2006.18 | Rio de Janeiro |
Keywords | Field | DocType |
scheduled system,underlying run-time system,system model,available system model,existing analysis technique,maximum stack usage,exact problem formulation,comprehensive evaluation,typical task,preemptive system model,preemptive shared stack systems,real-time system,real time system,real time systems | Shared memory,Computer science,Compile time,Parallel computing,Call stack,Stack register,Stack trace,Real-time computing,Region-based memory management,Distributed shared memory,Stack-based memory allocation,Distributed computing | Conference |
ISSN | ISBN | Citations |
1052-8725 | 0-7695-2761-2 | 13 |
PageRank | References | Authors |
0.64 | 19 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kaj Hanninen | 1 | 18 | 1.21 |
| jukka makiturja | 2 | 75 | 5.98 |
| Markus Bohlin | 3 | 77 | 14.24 |
| Jan Carlson | 4 | 416 | 41.20 |
| mikael sjodin | 5 | 13 | 0.64 |