LFU-K: An Effective Buffer Management Replacement Algorithm
- 1 January 2004
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policiesACM SIGMETRICS Performance Evaluation Review, 1999
- An optimality proof of the LRU- K page replacement algorithmJournal of the ACM, 1999
- The five-minute rule ten years later, and other computer storage rules of thumbACM SIGMOD Record, 1997
- The LRU-K page replacement algorithm for database disk bufferingPublished by Association for Computing Machinery (ACM) ,1993
- Data cache management using frequency-based replacementPublished by Association for Computing Machinery (ACM) ,1990
- Principles of database buffer managementACM Transactions on Database Systems, 1984
- Principles of Optimal Page ReplacementJournal of the ACM, 1971
- Evaluation techniques for storage hierarchiesIBM Systems Journal, 1970
- A study of replacement algorithms for a virtual-storage computerIBM Systems Journal, 1966
- Note on random addressing techniquesIBM Systems Journal, 1963