WCET ANALYSIS OF MULTI-LEVEL SET-ASSOCIATIVE DATA CACHES

Benjamin Lesage 1 Damien Hardy 1 Isabelle Puaut 1
1 ALF - Amdahl's Law is Forever
Inria Rennes – Bretagne Atlantique , IRISA-D3 - ARCHITECTURE
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/inria-00531218
Contributor : Benjamin Lesage <>
Submitted on : Tuesday, November 2, 2010 - 10:45:15 AM
Last modification on : Thursday, November 15, 2018 - 11:57:43 AM
Long-term archiving on : Friday, December 2, 2016 - 12:30:13 AM

File

paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00531218, version 1

Citation

Benjamin Lesage, Damien Hardy, Isabelle Puaut. WCET ANALYSIS OF MULTI-LEVEL SET-ASSOCIATIVE DATA CACHES. 9th Intl. Workshop on Worst-Case Execution Time WCET Analysis, Jun 2009, Dublin, Ireland. pp.2283. ⟨inria-00531218⟩

Share

Metrics

Record views

424

Files downloads

302