A Replacement Algorithm for Highly Associative Caches
Year: 1989
Type: preprint
Abstract: 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.
Source: SSRN Electronic Journal
Author: Jon M. Peha
Institution: Carnegie Mellon University
Language: English
Subfield: Hardware and Architecture
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2313607415
