2019
DOI: 10.1016/j.sysarc.2018.12.007
|View full text |Cite
|
Sign up to set email alerts
|

Locality-aware cache random replacement policies

Abstract: Measurement-Based Probabilistic Timing Analysis (MBPTA) facilitates the analysis of complex software running on hardware comprising high-performance features. MBPTA also aims at preventing additional analysis costs for timing analysis techniques and preserving the confidence on derived WCET estimates. Cache behavior has a deep influence on WCET estimates and hence on "the amount of software" that can be consolidated onto a single hardware platform. Deterministic replacement policies such as LRU (Least Recently… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 24 publications
0
2
0
Order By: Relevance
“…For instance, this is the case for Least Recently Used (LRU), first-in first-out (FIFO), Random Replacement (RR), and pseudo-LRU among others. Dominance, instead, may not hold for some replacement policies [26], such as LRU dominance. Let us illustrate this fact with an example.…”
Section: Implementation Constraintsmentioning
confidence: 99%
“…For instance, this is the case for Least Recently Used (LRU), first-in first-out (FIFO), Random Replacement (RR), and pseudo-LRU among others. Dominance, instead, may not hold for some replacement policies [26], such as LRU dominance. Let us illustrate this fact with an example.…”
Section: Implementation Constraintsmentioning
confidence: 99%
“…Works like [74] effectively employ this policy for SPTA. Recently, Random Permutation Replacement (RPR) was proposed as a new random replacement policy that improves on previous proposals by avoiding pathological eviction patterns [75].…”
Section: Random Replacementmentioning
confidence: 99%