Identity of King and Flajolet & al. Formulae for LRU Miss Rate Exact Computation
Christian Berthet
TL;DR
This paper provides a detailed proof of the identity between two classic formulas for calculating the exact miss rate of LRU caches and extends this identity to related coupon collector problem formulas.
Contribution
It offers a rigorous proof of the equivalence between two well-known formulas for LRU miss rate and extends this identity to the coupon collector problem.
Findings
Confirmed the identity between two LRU miss rate formulas
Extended the identity to coupon collector problem formulas
Provided detailed proofs for the formulas' equivalence
Abstract
This short paper gives a detailed proof of identity between two classic formulas for the computation of the exact Miss Rate of LRU caches. An extension to the identity of two formulas of the expected time of a partial collection in the coupon collector problem is also presented.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Algorithms and Data Compression · Parallel Computing and Optimization Techniques