OASIcs.WCET.2012.25.pdf
- Filesize: 488 kB
- 13 pages
Document
Computing Same Block Relations for Relational Cache Analysis
Author
-
Part of:
Volume:
12th International Workshop on Worst-Case Execution Time Analysis (WCET 2012)
Series: Open Access Series in Informatics (OASIcs)
Conference: Workshop on Worst-Case Execution Time Analysis (WCET) - License:
Creative Commons Attribution-NoDerivs 3.0 Unported license
- Publication Date: 2012-07-10
Cite AsGet BibTex
Simon Wegener. Computing Same Block Relations for Relational Cache Analysis. In 12th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 23, pp. 25-37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
https://doi.org/10.4230/OASIcs.WCET.2012.25
https://doi.org/10.4230/OASIcs.WCET.2012.25
Abstract
In contrast to the classical cache analysis of Ferdinand, the relational cache analysis does not rely on precise address information. Instead, it uses same block relations between memory accesses to predict cache hits. The relational data cache analysis can thus also predict cache hits if fully unrolling a loop is not feasible during analysis, for example due to high memory consumption or long computation time. This paper proposes a static analysis based on abstract interpretation which is able to compute same block relations for relational cache analysis.
Keywords
- Cache Analysis
- WCET Analysis
- Real-time Systems
- Static Program Analysis
- Abstract Interpretation
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads