The Community for Technology Leaders
Green Image
Issue No. 04 - April (2004 vol. 37)
ISSN: 0018-9162
pp: 58-65
Nimrod Megiddo , IBM Almaden Research Center
Dharmendra S. Modha , IBM Almaden Research Center
ABSTRACT
The policy of choice for managing cache memory has been to discard the least-recently-used item. LRU has consistently outperformed other policies by virtue of its simplicity and low overhead. However, an adaptive replacement cache algorithm offers a low-overhead alternative that shows substantial performance gains over LRU. ARC's online adaptation continually balances between a workload?s recency and frequency features, eliminating the need for the workload-specific pretuning that plagued many previous proposals to improve LRU. The algorithm has the additional advantage of being scan-resistant so that one-time sequential requests can pass through without polluting the cache.
INDEX TERMS
CITATION

D. S. Modha and N. Megiddo, "Outperforming LRU with an Adaptive Replacement Cache Algorithm," in Computer, vol. 37, no. , pp. 58-65, 2004.
doi:10.1109/MC.2004.1297303
91 ms
(Ver 3.3 (11022016))