A fluid limit for a cache algorithm with general request processes
DOI10.1239/AAP/1282924064zbMATH Open1231.68296OpenAlexW2023745403MaRDI QIDQ3059697FDOQ3059697
Publication date: 26 November 2010
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/aap/1282924064
Recommendations
- Cache miss estimation for non-stationary request processes
- Modeling least recently used caches with shot noise request processes
- On the asymptotics of fault probability in least-recently-used caching with Zipf-type request distribution
- Least-recently-used caching with dependent requests
- LRU caching with moderately heavy request distributions
nonstationarypoint processapproximationinsensitivityfluid limithit probabilityleast-recently-used algorithm
Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Central limit and other weak theorems (60F05) Analysis of algorithms (68W40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
- Analysis of Page Replacement Policies in the Fluid Limit
- Title not available (Why is that?)
- On a model for storage and search
- On Serial Files with Relocatable Records
- The persistent-access-caching algorithm
- Title not available (Why is that?)
- Limits and rates of convergence for the distribution of search cost under the move-to-front rule
- Least-recently-used caching with dependent requests
- Performance of the move-to-front algorithm with Markov-modulated request sequences
- The performance of the move-to-front scheme under some particular forms of Markov requests
- Self-organizing files with dependent accesses
- Critical sizing of LRU caches with dependent requests
- On the asymptotics of fault probability in least-recently-used caching with Zipf-type request distribution
- A New Method for Computing Page-Fault Rates
This page was built for publication: A fluid limit for a cache algorithm with general request processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059697)
