A Replacement Algorithm for Highly Associative Caches
IEE International Symposium on Computer Architecture and Digital Signal Processing, 1989
6 Pages Posted: 1 Apr 2016
Date Written: October 1, 1989
A new cache replacement algorithm is described that approximates the performance of least-recently used (LRU) selection. The algorithm offers substantial savings of storage overhead in highly associative caches. Its applications include CPU cache memories, virtual to read address translation, and virtual memory page management.
Keywords: cache, replacement algorithm, stochastic LRU
Suggested Citation: Suggested Citation