Recent studies have shown that, in highly associative caches, the performance gap between
the least recently used (LRU) and the theoretical optimal replacement algorithms is large …

Recent studies have shown that in highly associative caches, the performance gap between
the least recently used (LRU) and the theoretical optimal replacement algorithms is large …

This thesis describes a model used to analyze the replacement decisions made by LRU and
OPT (Least-Recently-Used and an optimal replacement-algorithm). The model identifies a …

Replacement policy, one of the key factors determining the effectiveness of a cache,
becomes even more important with latest technological trends toward highly associative …

Inclusive last-level caches (LLCs) waste precious silicon estate due to cross-level replication
of cache blocks. As the industry moves toward cache hierarchies with larger inner levels, this …

Due to the increasing gap between CPU and memory speed, cache performance plays an
increasingly critical role in determining the overall performance of microprocessor systems …

Cache replacement algorithms originally developed in the context of simple uniprocessor
systems aim to reduce the miss count. However, in modern systems, cache misses have …

This paper makes the case for the use of XOR-based placement functions for cache
memories. It shows that these XOR-mapping schemes can eliminate many conflict misses …

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 …

The performance of set associative caches is analyzed. The method used is to group the
cache lines into regions according to their positions in the replacement stacks of a cache …