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

DOI10.1109/TC.1973.5009115MaRDI QIDQ5674398zbMATH OpenFDO

Authors Erol Gelenbe

Publication date 1973

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1973.5009115

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited in

(14)

• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• A decomposable model of program paging behaviour
• Optimal control of demand-paging systems
• Asymptotic miss ratios over independent references
• A note on the influence of program loading on the page fault rate
• Optimal timer-based caching policies for general arrival processes
• The impact of overload conditions on computer network reliability
• G-networks and their applications to machine learning, energy packet networks and routing: Introduction to the special issue
• Transient and steady-state regime of a family of list-based cache replacement algorithms
• Properties of stochastic syntax-directed translation schemata
• On Optimal Performance in Self-Organizing Paging Algorithams
• On the working set size and its normal approximation
• Festschrift for Erol Gelenbe's 70th birthday
• EROL GELENBE: A CAREER IN MULTI-DISCIPLINARY PROBABILITY MODELS

This page was built for publication: A Unified Approach to the Evaluation of a Class of Replacement Algorithms

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