OASIcs.WCET.2010.23.pdf
- Filesize: 0.53 MB
- 13 pages
Document
Toward Precise PLRU Cache Analysis
Authors
-
Part of:
Volume:
10th International Workshop on Worst-Case Execution Time Analysis (WCET 2010)
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: 2010-11-26
Cite As Get BibTex
Daniel Grund and Jan Reineke. Toward Precise PLRU Cache Analysis. In 10th International Workshop on Worst-Case Execution Time Analysis (WCET 2010). Open Access Series in Informatics (OASIcs), Volume 15, pp. 23-35, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/OASIcs.WCET.2010.23
Abstract
Schedulability analysis for hard real-time systems requires bounds on the execution times of its tasks. To obtain useful bounds in the presence of caches, cache analysis is mandatory. The subject-matter of this article is the static analysis of the tree-based PLRU cache replacement policy (pseudo least-recently used), for which the precision of analyses lags behind those of other policies. We introduce the term subtree distance, which is important for the update behavior of PLRU and closely linked to the peculiarity of PLRU that allows cache contents to be evicted in "logarithmic time". Based on an abstraction of subtree distance, we define a must-analysis that is more precise than prior ones by excluding spurious logarithmic-time eviction.
Subject Classification
Keywords
- Cache Analysis
- PLRU Replacement
- PLRU Tree
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads