DROPS

Document

DOI: 10.4230/OASIcs.WCET.2014.83

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

Authors: Sahar Abbaspour, Alexander Jordan, and Florian Brandner

Published in: OASIcs, Volume 39, 14th International Workshop on Worst-Case Execution Time Analysis (2014)

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.

Cite as

Sahar Abbaspour, Alexander Jordan, and Florian Brandner. Lazy Spilling for a Time-Predictable Stack Cache: Implementation and Analysis. In 14th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 39, pp. 83-92, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)

Copy BibTex To Clipboard

@InProceedings{abbaspour_et_al:OASIcs.WCET.2014.83,
  author =	{Abbaspour, Sahar and Jordan, Alexander and Brandner, Florian},
  title =	{{Lazy Spilling for a Time-Predictable Stack Cache: Implementation and Analysis}},
  booktitle =	{14th International Workshop on Worst-Case Execution Time Analysis},
  pages =	{83--92},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-69-9},
  ISSN =	{2190-6807},
  year =	{2014},
  volume =	{39},
  editor =	{Falk, Heiko},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2014.83},
  URN =		{urn:nbn:de:0030-drops-46073},
  doi =		{10.4230/OASIcs.WCET.2014.83},
  annote =	{Keywords: Lazy Spilling, Stack Cache, Real-Time Systems, Program Analysis}
}

Search Results

Documents authored by Jordan, Alexander

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

Abstract

Cite as

Thanks for your feedback!

Could not send message