ARC: A Self-Tuning, Low Overhead Replacement Cache

ARC: A Self-Tuning, Low Overhead Replacement Cache (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Nimrod Megiddo , Dharmendra Modha

Venue:	In Proceedings of the 2003 Conference on File and Storage Technologies (FAST
Citations:	129 - 4 self

Versions

Version History

Metadata Version 2

Datum	Value	Source
TITLE	ARC: A self-tuning, low overhead replacement cache	INFERENCE
AUTHOR NAME	Nimrod Megiddo	SVM HeaderParse 0.1
AUTHOR AFFIL	IBM Almaden Research Center	SVM HeaderParse 0.2
AUTHOR ADDR	650 Harry Road, San Jose, CA 95120	SVM HeaderParse 0.1
AUTHOR NAME	Dharmendra S. Modha	SVM HeaderParse 0.1
AUTHOR AFFIL	IBM Almaden Research Center	SVM HeaderParse 0.2
AUTHOR ADDR	650 Harry Road, San Jose, CA 95120	SVM HeaderParse 0.1
ABSTRACT	Abstract--- We consider the problem of cache management in a demand paging scenario with uniform page sizes. We propose a new cache management policy, namely, Adaptive Replacement Cache (ARC), that has several advantages. In response to evolving and changing access patterns, ARC dynamically, adaptively, and continually balances between the recency and frequency components in an online and selftuning fashion. The policy ARC uses a learning rule to adaptively and continually revise its assumptions about the workload. The policy ARC is empirically universal, that is, it empirically performs as well as a certain fixed replacement policy--even when the latter uses the best workload-specific tuning parameter that was selected in an offline fashion. Consequently, ARC works uniformly well across varied workloads and cache sizes without any need for workload specific a priori knowledge or tuning. Various policies such as LRU-2, 2Q, LRFU, and LIRS require user-defined parameters, and, unfortunately, no single choice works uniformly well across different workloads and cache sizes. The policy ARC is simple-to-implement and, like LRU, has constant complexity per request. In comparison, policies LRU-2 and LRFU both require logarithmic time complexity in the cache size. The policy ARC is scan-resistant: it allows one-time sequential requests to pass through without polluting the cache.	SVM HeaderParse 0.1
YEAR	2003	INFERENCE
VENUE	In Proceedings of the 2003 Conference on File and Storage Technologies (FAST	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	115--130	INFERENCE
CITATIONS	33 found	ParsCit 1.0