Asymptotic miss ratios over independent references

DOI10.1016/S0022-0000(77)80014-7zbMath0355.60009OpenAlexW2130356538MaRDI QIDQ1237304

Ronald Fagin

Publication date: 1977

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(77)80014-7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Probability distributions: general theory (60E05) Combinatorial probability (60C05) Information storage and retrieval of data (68P20) Limit theorems in probability theory (60F99)

Related Items

The coupon collector’s problem revisited: generalizing the double Dixie cup problem of Newman and Shepp ⋮ Birthday paradox, coupon collectors, caching algorithms and self- organizing search ⋮ Stochastic ranking process with time dependent intensities ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model for Interactive Data Base Reference String
• The independence of miss ratio on page size
• MIN—an optimal variable-space page replacement algorithm
• On the Optimality of the Probability Ranking Scheme in Storage Applications
• Differentiability of jump functions
• Principles of Optimal Page Replacement
• Properties of the working-set model
• A Unified Approach to the Evaluation of a Class of Replacement Algorithms

This page was built for publication: Asymptotic miss ratios over independent references