OASIcs.WCET.2009.2283.pdf
- Filesize: 130 kB
- 12 pages
Document
WCET Analysis of Multi-Level Set-Associative Data Caches
Authors
-
Part of:
Volume:
9th International Workshop on Worst-Case Execution Time Analysis (WCET'09) (WCET 2009)
Series: Open Access Series in Informatics (OASIcs)
Conference: Workshop on Worst-Case Execution Time Analysis (WCET) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2009-11-26
Cite As Get BibTex
Benjamin Lesage, Damien Hardy, and Isabelle Puaut. WCET Analysis of Multi-Level Set-Associative Data Caches. In 9th International Workshop on Worst-Case Execution Time Analysis (WCET'09). Open Access Series in Informatics (OASIcs), Volume 10, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/OASIcs.WCET.2009.2283
Abstract
Nowadays, the presence of cache hierarchies tends to be a common trend in processor architectures, even in hardware for real-time embedded systems. Caches are used to fill the gap between the processor and the main memory, reducing access times based on spatial and temporal locality properties of tasks. Cache hierarchies are going even further however at the price of increased complexity. In this paper, we present a safe static data cache analysis method for hierarchies of non-inclusive caches. Using this method, we show that considering the cache hierarchy in the context of data caches allows tighter estimates of the worst case execution time than when considering only the first cache level. We also present considerations about the update policy for data caches.
Subject Classification
Keywords
- WCET analysis
- data cache
- multi-level
- set-associative
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads