Least-recently-used caching with dependent requests
From MaRDI portal
(Redirected from Publication:703555)
Recommendations
- LRU caching with moderately heavy request distributions
- Critical sizing of LRU caches with dependent requests
- On the asymptotics of fault probability in least-recently-used caching with Zipf-type request distribution
- The persistent-access-caching algorithm
- Asymptotic optimality of the static frequency caching in the presence of correlated requests
Cites work
- scientific article; zbMATH DE number 410740 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3532286 (Why is no real title available?)
- scientific article; zbMATH DE number 795110 (Why is no real title available?)
- scientific article; zbMATH DE number 847278 (Why is no real title available?)
- scientific article; zbMATH DE number 903457 (Why is no real title available?)
- An exact formula for the move-to-front rule for self-organizing lists
- Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
- Asymptotic loss probability in a finite buffer fluid queue with heterogeneous heavy-tailed on-off processes
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Competitive paging with locality of reference
- Heuristics That Dynamically Organize Data Structures
- Large deviations of sums of independent random variables
- 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 self-organizing sequential search heuristics
- On the transition probabilities of the move-to-front scheme
- Performance of the move-to-front algorithm with Markov-modulated request sequences
- Strongly Competitive Algorithms for Paging with Locality of Reference
- Subexponential asymptotics of a Markov-modulated random walk with queueing applications
- The performance of the move-to-front scheme under some particular forms of Markov requests
Cited in
(16)- A fluid limit for a cache algorithm with general request processes
- Analysis of LRU cache trees with a power law reference distribution
- On the asymptotics of fault probability in least-recently-used caching with Zipf-type request distribution
- Critical sizing of LRU caches with dependent requests
- LRU caching with moderately heavy request distributions
- Functional central limit theorem for tagged particle dynamics in stochastic ranking process with space-time dependent intensities
- Optimizing LRU Caching for Variable Document Sizes
- Asymptotic optimality of the static frequency caching in the presence of correlated requests
- Near optimality of the discrete persistent access caching algorithm
- Optimal timer-based caching policies for general arrival processes
- Asymptotic optimality of the static frequency caching in the presence of correlated requests
- Cache miss estimation for non-stationary request processes
- Modeling least recently used caches with shot noise request processes
- Comparing locality of reference -- some folk theorems for the miss rate and the output of caches
- Approximate analysis of LRU in the case of short term correlations
- Stochastic ranking process with time dependent intensities
This page was built for publication: Least-recently-used caching with dependent requests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703555)
