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 …

Due to the ever increasing performance gap between the processor and the main memory, it
becomes crucial to bridge that gap by designing an efficient memory hierarchy capable of …

Cache replacement algorithms originally developed in the context of uniprocessors
executing one instruction at a time implicitly assume that all cache misses have the same …

Cache replacement policies such as FIFO (First-In/First-Out), LRU (Least Recently Used)
and OPT (OPTimum) were conceived in the context of uniprocessor systems in which the …

Several cache management techniques have been proposed that indirectly try to base their
decisions on cacheline reuse-distance, like Cache Decay which is a postdiction of reuse …

Although the LRU replacement algorithm has been widely used in cache memory
management, it is well-known for its inability to be easily implemented in hardware. Most of …

Memory performance is increasingly determining microprocessor performance and
technology trends are exacerbating this problem. Most architectures use set-associative …

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 …

In this paper we propose a replacement algorithm, SF-LRU (second chance-frequency-least
recently used) that combines the LRU (least recently used) and the LFU (least frequently …

This book summarizes the landscape of cache replacement policies for CPU data caches.
The emphasis is on algorithmic issues, so the authors start by defining a taxonomy that …