On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies
暂无分享,去创建一个
Sang Lyul Min | Jongmoo Choi | Yookun Cho | Sam H. Noh | Chong-Sang Kim | Donghee Lee | Jong-Hun Kim | S. Noh | S. Min | Jongmoo Choi | Donghee Lee | Yookun Cho | Chong-Sang Kim | Jong-Hun Kim
[1] FaloutsosChristos,et al. Flexible and Adaptable Buffer Management Techniques for Database Management Systems , 1995 .
[2] Gururaj S. Rao,et al. Performance Analysis of Cache Memories , 1978, JACM.
[3] Gerhard Weikum,et al. The LRU-K page replacement algorithm for database disk buffering , 1993, SIGMOD Conference.
[4] Kai Li,et al. Application-Controlled File Caching Policies , 1994, USENIX Summer.
[5] Christos Faloutsos,et al. Flexible and Adaptable Buffer Management Techniques for Database Management Systems , 1995, IEEE Trans. Computers.
[6] Jeffrey R. Spirn,et al. Program Behavior: Models and Measurements , 1977 .
[7] Mary Baker,et al. Measurements of a distributed file system , 1991, SOSP '91.
[8] Dennis Shasha,et al. 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm , 1994, VLDB.
[9] Wolfgang Effelsberg,et al. Principles of database buffer management , 1984, TODS.
[10] J. T. Robinson,et al. Data cache management using frequency-based replacement , 1990, SIGMETRICS '90.