LRU Cache under Stationary Requests
Authors:
Open Access
- 11 October 2017
- journal article
- abstracts
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 45 (2) , 24-26
Abstract
In this paper we extend an approximation first proposed by Fagin [4] for the LRU cache under the independence reference model to systems where requests for different contents form independent stationary and ergodic processes. We show that this approximation becomes exact as the number of contents goes to infinity while maintaining the fraction of the contents that can populate the cache to be constant. Last, we provide results on the rate of convergence.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- A Unified Approach to the Performance Analysis of Caching SystemsACM Transactions on Modeling and Performance Evaluation of Computing Systems, 2016
- Elements of Queueing Theory2003
- Hierarchical Web caching systems: modeling, design and experimental resultsIEEE Journal on Selected Areas in Communications, 2002
- An approximate analysis of the LRU and FIFO buffer replacement schemes1990
- Asymptotic miss ratios over independent referencesJournal of Computer and System Sciences, 1977