Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search

@article{Flajolet1992BirthdayPC,
  title={Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search},
  author={Philippe Flajolet and Dani{\`e}le Gardy and Lo{\"y}s Thimonier},
  journal={Discret. Appl. Math.},
  year={1992},
  volume={39},
  pages={207-229}
}
View via Publisher
doi.org
426 Citations
Highly Influential Citations
30
Background Citations
179
Methods Citations
65
Results Citations
13

426 Citations

Optimizing the LRU algorithm for web caching

Critical sizing of LRU caches with dependent requests

It was recently proved by Jelenković and Radovanović (2004) that the least-recently-used (LRU) caching policy, in the presence of semi-Markov-modulated requests that have a generalized Zipf's law…

Least-recently-used caching with dependent requests

The surprising insensitivity of LRU caching performance demonstrates its robustness to changes in document popularity, and the derived asymptotic result and simulation experiments are in excellent agreement, even for relatively small cache sizes.

Contributions to the Generalized Coupon Collector and LRU Problems

A very simple asymptotic relation is derived between the expectation of the waiting time for a partial collection in the CCP, and the Miss rate of a LRU cache.

OPTIMALITY OF THE MOVE-TO-FRONT HEURISTIC FOR SELF-ORGANIZING DATA STRUCTURES

This paper considers the class f* of stochastic matrices P such that move-to-front is optimal among on-line rules, with respect to the stationary search cost, and produces explicitly a large subclass of f*.

Least-recently-used caching with dependent requests

Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities

It is shown that, when the (limiting) request distribution has a heavy tail (e.g., generalized Zipf ’s law), P’R = n“ ∼ c/nα as n→ ∞, α > 1, then the limiting stationary search cost distribution, or the least-recently used (LRU) caching fault probability, satisfies the law.

The move-to-partner rule for self-organizing task allocation on a linear array

An analysis of the sequence of expected communication costs is enabled by reducing their computation to that of three-dimensional arrays of certain probabilities, for which a recursion formula and an asymptotic expansion can be given.

A Coupon Collector based approximation for LRU cache hits under Zipf requests

This paper derives a simple yet accurate approximation for the LRU content-wise hitrates under Zipf-distributed requests, in the regime of a large content population, and justifies the accuracy of these approximations by showing analytically that the characteristic time concentrates sharply around its mean.

Performance evaluation of hierarchical TTL-based cache networks

...

36 References

Some Results on Distribution-Free Analysis of Paging Algorithms

This work is devoted to the analysis of page replacement algorithms under assumptions on the stochastic nature of the sequence of memory accesses and results are derived using the assumption that the references to the pages are independent identically distributed (iid) random variables.

Exegesis of Self-Organizing Linear Search

We consider techniques for self-organizing linear search, examining the behavior of methods under arbitrary and specific probability distributions.The notion of moving an element forward after it has…

An Analysis of Optimum Caching

    D. Knuth
    Computer Science
    J. Algorithms
  • 1985

Heuristics That Dynamically Organize Data Structures

We first consider heuristics that dynamically alter linked lists, causing more frequently accessed keys to move nearer the “top” of the list. We show that the move to front rule reduces the access…

Optimal prepaging and font caching

An efficient algorithm for communicating letter-shape information from a high-speed computer with a large memory to a typesetting device that has a limited memory is presented, using a model that generalizes well-known “demand paging” strategies to the case where changes to the cache are allowed before the associated information is actually needed.

A Unified Approach to the Evaluation of a Class of Replacement Algorithms

    E. Gelenbe
    Computer Science
    IEEE Transactions on Computers
  • 1973
An automaton theoretic model of replacement algorithms is introduced for the class of ``random partially preloaded'' replacement algorithms, which contain certain algorithms of practical and theoretical interest and it is shown that the well-known page replacement algorithms FIFO and RAND yield the same long-run page-fault rates.

The A0 inversion model of program paging behavior

A model based on the independent reference model with a new procedure for determining the page reference probabilities is presented, which should be especially useful for evaluating multilevel memory organizations based on newly emerging memory technologies.

On self-organizing sequential search heuristics

Empirical evidence suggests that transposition is in fact optimal for any distribution of search probabilities, and the "move to front" and "transposition" heuristics are shown to be optimal to within a constant factor.

Asymptotic Miss Ratios over Independent References

Efficient Calculation of Expected Miss Ratios in the Independent Reference Model

An algorithm is presented which is both efficient and provably numerically stable, for calculating the expected FIFO miss ratio and an efficient method for obtaining an unbiased estimate of the expected LRU miss ratio.