ArC: A self-tuning, low overhead replacement cache

Proceedings of FAST 2003: 2nd USENIX Conference on File and Storage Technologies

Volumn , Issue , 2003, Pages 115-130

  Megiddo, Nimrod ^a   Modha, Dharmendra S ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MANAGEMENT POLICIES; LOGARITHMIC TIME; PRIORI KNOWLEDGE; RECENCY AND FREQUENCIES; REPLACEMENT POLICY; SYNTHETIC BENCHMARK; TUNING PARAMETER; USER-DEFINED PARAMETERS;

EID: 85048415470     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. J. Z. Teng and R. A. Gumaer, “Managing IBM database 2 buffers to maximize performance,” IBM Sys. J., vol. 23, no. 2, pp. 211–218, 1984.
2. P. Cao and S. Irani, “Cost-aware WWW proxy caching algorithms,” in Proc. USENIX Symp. Internet Technologies and Systems, Monterey, CA, 1997.
3. L. Degenaro, A. Iyengar, I. Lipkind, and I. Rouvellou, “A middleware system which intelligently caches query results,” in Middleware 2000, vol. LNCS 1795, pp. 24–44, 2000.
4. J. D. Gee, M. D. Hill, D. N. Pnevmatikatos, and A. J. Smith, “Cache performance of the SPEC benchmark suite,” Tech. Rep. CS-TR-1991-1049, University of California, Berkeley, 1991.
5. M. N. Nelson, B. B. Welch, and J. K. Ousterhout, “Caching in the Sprite network file system,” ACM Transactions on Computer Systems, vol. 6, no. 1, pp. 134–154, 1988.
6. A. J. Smith, “Disk cache-miss ratio analysis and design considerations,” ACM Trans. Computer Systems, vol. 3, no. 3, pp. 161–203, 1985.
7. P. M. Chen, E. L. Lee, G. A. Gibson, R. H. Katz, and D. A. Patterson, “RAID: High-performance, reliable secondary storage,” ACM Computing Surveys, vol. 26, no. 2, pp. 145–185, 1994.
8. M. J. Bach, The Design of the UNIX Operating System. Englewood Cliffs, NJ: Prentice-Hall, 1986.
9. J. L. Bentley, D. D. Sleator, R. E. Tarjan, and V. K. Wei, “A locally adaptive data compression scheme,” Comm. ACM, vol. 29, no. 4, pp. 320–330, 1986.
10. D. D. Sleator and R. E. Tarjan, “Amortized efficiency of list update and paging rules,” Comm. ACM, vol. 28, no. 2, pp. 202–208, 1985.
11. J. Ziv and A. Lempel, “A universal algorithm for sequential data compression,” IEEE Trans. Inform. Theory, vol. 23, no. 3, pp. 337–343, 1977.
12. L. A. Belady, “A study of replacement algorithms for virtual storage computers,” IBM Sys. J., vol. 5, no. 2, pp. 78–101, 1966.
13. R. L. Mattson, J. Gecsei, D. R. Slutz, and I. L. Traiger, “Evaluation techniques for storage hierarchies,” IBM Sys. J., vol. 9, no. 2, pp. 78–117, 1970.
14. P. J. Denning, “Working sets past and present,” IEEE Trans. Software Engineeing, vol. SE-6, no. 1, pp. 64–84, 1980.
15. W. R. Carr and J. L. Hennessy, “WSClock – a simple and effective algorithm for virtual memory management,” in Proc. Eighth Symp. Operating System Principles, pp. 87–95, 1981.
16. J. E. G. Coffman and P. J. Denning, Operating Systems Theory. Englewood Cliffs, NJ: Prentice-Hall, 1973.
17. A. V. Aho, P. J. Denning, and J. D. Ullman, “Principles of optimal page replacement,” J. ACM, vol. 18, no. 1, pp. 80–93, 1971.
18. E. J. O’Neil, P. E. O’Neil, and G. Weikum, “The LRU-K page replacement algorithm for database disk buffering,” in Proc. ACM SIGMOD Conf., pp. 297–306, 1993.
19. 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, pp. 92–112, 1999.
20. T. Johnson and D. Shasha, “2Q: A low overhead high performance buffer management replacement algorithm,” in Proc. VLDB Conf., pp. 297–306, 1994.
21. S. Jiang and X. Zhang, “LIRS: An efficient low inter-reference recency set replacement policy to improve buffer cache performance,” in Proc. ACM SIGMETRICS Conf., 2002.
22. J. T. Robinson and M. V. Devarakonda, “Data cache management using frequency-based replacement,” in Proc. ACM SIGMETRICS Conf., pp. 134–142, 1990.
23. D. Lee, J. Choi, J.-H. Kim, S. H. Noh, S. L. Min, Y. Cho, and C. S. Kim, “LRFU: A spectrum of policies that subsumes the least recently used and least frequently used policies,” IEEE Trans. Computers, vol. 50, no. 12, pp. 1352–1360, 2001.
24. D. Lee, J. Choi, J.-H. Kim, S. H. Noh, S. L. Min, Y. Cho, and C. S. Kim, “On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies,” in Proc. ACM SIGMETRICS Conf., pp. 134–143, 1999.
25. Y. Zhou and J. F. Philbin, “The multi-queue replacement algorithm for second level buffer caches,” in Proc. USENIX Annual Tech. Conf. (USENIX 2001), Boston, MA, pp. 91–104, June 2001.
26. R. B. Gramacy, M. K. Warmuth, S. A. Brandt, and I. Ari, “Adaptive caching by refetching,” in NIPS, 2002.
27. I. Ari, A. Amer, R. Gramarcy, E. Miller, S. Brandt, and D. Long, “ACME: Adaptive caching using multiple experts,” in Proceedings of the Workshop on Distributed Data and Structures (WDAS), Carleton Scientific, 2002.
28. T. M. Wong and J. Wilkes, “My cache or yours? making storage more exclusive,” in Proc. USENIX Annual Tech. Conf. (USENIX 2002), Monterey, CA, pp. 161–175, June 2002.
29. W. W. Hsu, A. J. Smith, and H. C. Young, “The automatic improvement of locality in storage systems.” Tech. Rep., Computer Science Division, Univ. California, Berkeley, Nov. 2001.
30. W. W. Hsu, A. J. Smith, and H. C. Young, “Characteristics of I/O traffic in personal computer and server workloads.” Tech. Rep., Computer Science Division, Univ. California, Berkeley, July 2001.
31. B. McNutt and S. A. Johnson, “A standard test of I/O cache,” in Proc. the Computer Measurements Group’s 2001 International Conference, 2001.
32. S. A. Johnson, B. McNutt, and R. Reich, “The making of a standard benchmark for open system storage,” J. Comput. Resource Management, no. 101, pp. 26–32, Winter 2001.
33. B. McNutt, The Fractal Structure of Data Reference: Applications to the Memory Hierarchy. Boston, MA: Kluwer Academic Publishers, 2000.