Birthday paradox, coupon collectors, caching algorithms and self-organizing search
Discrete Applied Mathematics
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
On the distribution of search cost for the move-to-front rule
Random Structures & Algorithms
Limits and rates of convergence for the distribution of search cost under the move-to-front rule
Theoretical Computer Science
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Simulation Modeling and Analysis
Simulation Modeling and Analysis
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The Multi-Queue Replacement Algorithm for Second Level Buffer Caches
Proceedings of the General Track: 2002 USENIX Annual Technical Conference
Optimizing LRU Caching for Variable Document Sizes
Combinatorics, Probability and Computing
Least-recently-used caching with dependent requests
Theoretical Computer Science
ARC: A Self-Tuning, Low Overhead Replacement Cache
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
The LCD interconnection of LRU caches and its analysis
Performance Evaluation
Random Structures & Algorithms
Hierarchical Web caching systems: modeling, design and experimental results
IEEE Journal on Selected Areas in Communications
Fluid limit analysis of FIFO and RR caching for independent reference models
Performance Evaluation
| Hi-index | 0.00 |
The performance of storage systems and database systems depends significantly on the page replacement policies. Although many page replacement policies have been discussed in the literature, their performances are not fully understood. We introduce analytical techniques for evaluating the performances of page replacement policies including two queue (2Q), which manages two buffers to capture both the recency and frequency of requests. We derive an exact expression for the probability that a requested item is found (the hit probability) in a buffer managed by 2Q in the fluid limit, where the number of items is scaled by n, the size of items is scaled by 1/n, and n approaches infinity. The hit probability in the fluid limit approximates the hit probability in the original system, and we find that the relative error in the approximation is typically within 1%. Our analysis also illuminates several fundamental properties of 2Q useful for system designers.