Outperforming LRU with an adaptive replacement cache algorithm

Computer

Volumn 37, Issue 4, 2004, Pages 58-65

  Megiddo, Nimrod ^a   Modha, Dharmendra S ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER OPERATING SYSTEMS; COMPUTER WORKSTATIONS; DATA COMPRESSION; DATABASE SYSTEMS; FILE ORGANIZATION; MIDDLEWARE; SERVERS;

ADAPTIVE REPLACEMENT CACHE ALGORITHM; LOGARITHMIC COMPLEXITY; MULTIQUEUE REPLACEMENT POLICY; STACK DEPTH DISTRIBUTION;

BUFFER STORAGE;

EID: 1942436232     PISSN: 00189162     EISSN: None     Source Type: Trade Journal    
DOI: 10.1109/MC.2004.1297303     Document Type: Article

References (16)

1. R.L. Mattson et al., "Evaluation Techniques for Storage Hierarchies," IBM Systems J., vol. 9, no. 2, 1970, pp. 78-117.
2. D.D. Sleator and R.E. Tarjan, "Amortized Efficiency of List Update and Paging Rules," Comm. ACM, vol. 28, no. 2, 1985, pp. 202-208.
3. L.A. Belady, "A Study of Replacement Algorithms for Virtual Storage Computers," IBM Systems J., vol. 5, no. 2, 1966, pp. 78-101.
4. F.J. Corbato, "A Paging Experiment with the Multics System," In Honor of P.M. Morse, MIT Press, 1969, pp. 217-228.
5. P.J. Denning, "Working Sets Past and Present," IEEE Trans. Software Eng., vol. 6, no. 1, 1980, pp. 64-84.
6. W.R. Carr and J.L. Hennessy, "WSClock - A Simple and Effective Algorithm for Virtual Memory Management," Proc. 8th Symp. Operating System Principles, ACM Press, 1981, pp. 87-95.
7. J.E.G. Coffman and P.J. Denning, Operating Systems Theory, Prentice Hall, 1973, p. 282.
8. A.V. Aho, P.J. Denning, and J.D. Ullman, "Principles of Optimal Page Replacement," J. ACM, vol. 18, no. 1, 1971, pp. 80-93.
9. E.J. O'Neil, P.E. O'Neil, and G. Weikum, "An Optimality Proof of the LRU-K Page Replacement Algorithm," J. ACM, vol. 46, no. 1, 1999, pp. 92-112.
10. T. Johnson and D. Shasha, "2Q: A Low Overhead High-Performance Buffer Management Replacement Algorithm," Proc. VLDB Conf., Morgan Kaufmann, 1994, pp. 297-306.
11. S. Jiang and X. Zhang, "LIRS: An Efficient Low Inter-Reference Recency Set Replacement Policy to Improve Buffer Cache Performance," Proc. ACM Sigmetrics Conf., ACM Press, 2002, pp. 31-42.
12. J.T. Robinson and M.V. Devarakonda, "Data Cache Management Using Frequency-Based Replacement," Proc. ACM SIGMETRICS Conf., ACM Press, 1990, pp. 134-142.
13. D. Lee et al., "LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies," IEEE Trans. Computers, vol. 50, no. 12, 2001, pp. 1352-1360.
14. Y. Zhou and J.F. Philbin, "The Multi-Queue Replacement Algorithm for Second-Level Buffer Caches," Proc. Usenix Ann. Tech. Conf. (Usenix 2001), Usenix, 2001, pp. 91-104.
15. W.W. Hsu, A.J. Smith, and H.C. Young, The Automatic Improvement of Locality in Storage Systems, tech. report, Computer Science Division, Univ. of California, Berkeley, 2001.
16. N. Megiddo and D.S. Modha, "ARC: A Self-Tuning, Low Overhead Replacement Cache," Proc. Usenix Conf. File and Storage Technologies (FAST 2003), Usenix, 2003, pp. 115-130.