Lazy Spilling for a Time-Predictable Stack Cache: Implementation and Analysis

Abstract : The growing complexity of modern computer architectures increasingly complicates the prediction of the run-time behavior of software. For real-time systems, where a safe estimation of the program's worst-case execution time is needed, time-predictable computer architectures promise to resolve this problem. A stack cache, for instance, allows the compiler to efficiently cache a program's stack, while static analysis of its behavior remains easy. Likewise, its implementation requires little hardware overhead. This work introduces an optimization of the standard stack cache to avoid redundant spilling of the cache content to main memory, if the content was not modified in the meantime. At first sight, this appears to be an average-case optimization. Indeed, measurements show that the number of cache blocks spilled is reduced to about 17% and 30% in the mean, depending on the stack cache size. Furthermore, we show that lazy spilling can be analyzed with little extra effort, which benefits the worst-case spilling behavior that is relevant for a real-time system.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal-ensta-paris.archives-ouvertes.fr//hal-01056216
Contributor : Florian Brandner <>
Submitted on : Monday, August 18, 2014 - 11:01:13 AM
Last modification on : Wednesday, July 3, 2019 - 10:48:05 AM
Long-term archiving on: Tuesday, April 11, 2017 - 7:53:43 PM

File

10.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01056216, version 1

Collections

Citation

Sahar Abbaspour, Alexander Jordan, Florian Brandner. Lazy Spilling for a Time-Predictable Stack Cache: Implementation and Analysis. 14th International Workshop on Worst-Case Execution Time Analysis, Jul 2014, Madrid, Spain. pp.83-92. ⟨hal-01056216⟩

Share

Metrics

Record views

118

Files downloads

225