An approximate analysis of the LRU and FIFO buffer replacement schemes
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
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
A class of mean field interaction models for computer and communication systems
Performance Evaluation
A Unified Approach to the Evaluation of a Class of Replacement Algorithms
IEEE Transactions on Computers
Analysis of Page Replacement Policies in the Fluid Limit
Operations Research
Continuous approximation of collective system behaviour: A tutorial
Performance Evaluation
Performance evaluation of the random replacement policy for networks of caches
Performance Evaluation
Hi-index | 0.00 |
We study the fluid limit analysis of random replacement (RR) caching for the independent reference model. Applying the limit theorem for the mean field interaction model, we derive the fluid limit of fault probability in the transient state as well as in the steady state. Since the stationary fault probability for the RR cache is identical to that for the first-in first-out (FIFO) cache, our results on the stationary fault probability are available for the FIFO caching. We see that the fluid limit of stationary fault probability that we obtain is coincident with the existing heuristic approximation of stationary fault probability. That is, our fluid limit analysis gives a rigorous theoretical foundation to the heuristic approximation.