… caches with LRU replacement policies to combine fast access with relatively low miss rates.
To improve replacement decisions in set-associative caches, … practical one-bit cache-line tag …

… This study proposes a cache replacement policy technique to increase the cache hit rate. …
efficiency of cache management and performance. Heuristic cache replacement policies are …

… the generation of a cache replacement policy that is … (RL) to learn a cache replacement
policy. After analyzing the learned … We pose cache replacement as a Markov Decision Process (…

… This thesis describes a model used to analyze the replacement decisions made by LRU …
of the replacement decisions of LRU and compares them to the replacement decisions of OPT. …

… explains how a cache replacement algorithm can nonetheless learn from Belady’s algorithm
by applying it to past cache accesses to inform future cache replacement decisions. We …

… Since our target is to use the reuse-distance prediction to take informed decisions for cache
management, we consider reusedistances at a cacheline granularity (assuming 64B block). …

… replacement policies for 4MB to 32MB shared caches with … cache missratios with practical,
low-overhead replacement … cache approximates the optimal replacement decision in the …

… conclude that optimal caching decisions depend on the program’s control-flow history and
that a long control-flow history is beneficial. Second, the optimal decisions depend primarily …

… We now know that the life cycle of a cache line has multiple decision points, … decision
points.With this view, we argue that dead block predictors are a special case of cache replacement …

… S, where Ω(k) is the set of documents in the cache at time k and Yp is a decision variable set
to 1 if we decide to purge document p, and set to 0 if we decide to keep the document in the …