A fluid limit for a cache algorithm with general request processes

DOI10.1239/AAP/1282924064MaRDI QIDQ3059697zbMATH OpenOpenAlexFDO

Authors Takayuki Osogami

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

zbMATH Keywords

nonstationarypoint processapproximationinsensitivityfluid limithit probabilityleast-recently-used algorithm

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Central limit and other weak theorems (60F05) Analysis of algorithms (68W40)

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

Cites work

• scientific article; zbMATH DE number 785435 (Why is no real title available?)
• scientific article; zbMATH DE number 846911 (Why is no real title available?)
• scientific article; zbMATH DE number 903457 (Why is no real title available?)
• scientific article; zbMATH DE number 964178 (Why is no real title available?)
• A New Method for Computing Page-Fault Rates
• Analysis of page replacement policies in the fluid limit
• Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Critical sizing of LRU caches with dependent requests
• Least-recently-used caching with dependent requests
• Limits and rates of convergence for the distribution of search cost under the move-to-front rule
• On Serial Files with Relocatable Records
• On a model for storage and search
• On the asymptotics of fault probability in least-recently-used caching with Zipf-type request distribution
• Performance of the move-to-front algorithm with Markov-modulated request sequences
• Self-organizing files with dependent accesses
• The performance of the move-to-front scheme under some particular forms of Markov requests
• The persistent-access-caching algorithm

Cited in

(3)

• Cache miss estimation for non-stationary request processes
• Modeling least recently used caches with shot noise request processes
• Analysis of page replacement policies in the fluid limit

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)