H Choi, S Park - IEEE Access, 2022 - ieeexplore.ieee.org
… This study proposes a cachereplacement policy technique to increase the cache hit rate. … efficiency of cache management and performance. Heuristic cachereplacement policies are …
… the generation of a cachereplacement policy that is … (RL) to learn a cachereplacement policy. After analyzing the learned … We pose cachereplacement as a Markov Decision Process (…
… This thesis describes a model used to analyze the replacementdecisions made by LRU … of the replacementdecisions of LRU and compares them to the replacementdecisions of OPT. …
A Jain, C Lin - ACM SIGARCH Computer Architecture News, 2016 - dl.acm.org
… explains how a cachereplacement algorithm can nonetheless learn from Belady’s algorithm by applying it to past cache accesses to inform future cachereplacementdecisions. 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). …
J Zebchuk, S Makineni, D Newell - 2008 IEEE International …, 2008 - ieeexplore.ieee.org
… replacement policies for 4MB to 32MB shared caches with … cache missratios with practical, low-overhead replacement … cache approximates the optimal replacementdecision in the …
… conclude that optimal cachingdecisions 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 cachereplacement …
A Balamash, M Krunz - IEEE Communications Surveys & …, 2004 - ieeexplore.ieee.org
… 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 …