loading...
Outperforming LRU with an Adaptive Replacement Cache Algorithm
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MC.2004.1297303April 2004 (vol. 37 no. 4) pp. 58-65
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Nimrod Megiddo, IBM Almaden Research Center
Dharmendra S. Modha, IBM Almaden Research Center
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.
Citation:
Nimrod Megiddo, Dharmendra S. Modha, "Outperforming LRU with an Adaptive Replacement Cache Algorithm," Computer, vol. 37, no. 4, pp. 58-65, Apr. 2004, doi:10.1109/MC.2004.1297303
Usage of this product signifies your acceptance of the Terms of Use.