A Replacement Algorithm for Highly Associative Caches

IEE International Symposium on Computer Architecture and Digital Signal Processing, 1989

6 Pages Posted: 1 Apr 2016

See all articles by Jon M. Peha

Jon M. Peha

Carnegie Mellon University

Date Written: October 1, 1989

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.

Keywords: cache, replacement algorithm, stochastic LRU

Suggested Citation

Peha, Jon M., A Replacement Algorithm for Highly Associative Caches (October 1, 1989). IEE International Symposium on Computer Architecture and Digital Signal Processing, 1989. Available at SSRN: https://ssrn.com/abstract=2757265

Jon M. Peha (Contact Author)

Carnegie Mellon University ( email )

Pittsburgh, PA 15213-3890
United States

Here is the Coronavirus
related research on SSRN

Paper statistics

Downloads
10
Abstract Views
132
PlumX Metrics