Optimizing LRU Caching for Variable Document Sizes

DOI10.1017/S096354830400625XMaRDI QIDQ4670357zbMATH OpenFDO

Authors Predrag R. Jelenković, Ana Radovanović

Publication date 18 April 2005

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S096354830400625X

zbMATH Keywords

cache replacement algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Nonnumerical algorithms (68W05)

Recommendations

• LRU caching with moderately heavy request distributions
• Least-recently-used caching with dependent requests
• Probabilistic methods for web caching
• Page replacement with multi-size pages and applications to web caching
• The persistent-access-caching algorithm

Cited in

(12)

• Asymptotic optimality of the static frequency caching in the presence of correlated requests
• On the asymptotics of fault probability in least-recently-used caching with Zipf-type request distribution
• The persistent-access-caching algorithm
• An analysis of optimum caching
• scientific article; zbMATH DE number 1756091 (Why is no real title available?)
• Probabilistic methods for web caching
• Analysis of LRU cache trees with a power law reference distribution
• Cache miss estimation for non-stationary request processes
• LRU caching with moderately heavy request distributions
• Asymptotic optimality of the static frequency caching in the presence of correlated requests
• Critical sizing of LRU caches with dependent requests
• Near optimality of the discrete persistent access caching algorithm

This page was built for publication: Optimizing LRU Caching for Variable Document Sizes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4670357)