Practical cache replacement policies attempt to emulate optimal replacement by predicting
the re-reference interval of a cache block. The commonly used LRU replacement policy …

Belady's algorithm is optimal but infeasible because it requires knowledge of the future. This
paper explains how a cache replacement algorithm can nonetheless learn from Belady's …

The shared last-level caches in CMPs play an important role in improving application
performance and reducing off-chip memory bandwidth requirements. In order to use LLCs …

Last-level caches (LLCs) are large structures with significant power requirements. They can
be quite inefficient. On average, a cache block in a 2MB LRU-managed LLC is dead 86% of …

The disparity between last-level cache and memory latencies motivates the search for
efficient cache management policies. Recent work in predicting reuse of cache blocks …

Cache management policies such as replacement, bypass, or shared cache partitioning
have been relying on data reuse behavior to predict the future. This paper proposes a new …

Off-chip main memory has long been a bottleneck for system performance. With increasing
memory pressure due to multiple on-chip cores, effective cache utilization is important. In a …

Extensive research has been carried out to improve cache replacement policies, yet
designing an efficient cache replacement policy that incurs low hardware overhead remains …

The disparity between last-level cache and memory latencies motivates the search for
efficient cache management policies. Recent work in predicting reuse of cache blocks …

The ubiquity of graphics processing unit (GPU) architectures has made them efficient
alternatives to chip-multiprocessors for parallel workloads. GPUs achieve superior …