A Unified Approach to the Evaluation of a Class of Replacement Algorithms
From MaRDI portal
Publication:5674398
DOI10.1109/TC.1973.5009115zbMath0258.68015MaRDI QIDQ5674398
Publication date: 1973
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Related Items
The impact of overload conditions on computer network reliability ⋮ Optimal timer-based caching policies for general arrival processes ⋮ Transient and steady-state regime of a family of list-based cache replacement algorithms ⋮ FESTSCHRIFT FOR EROL GELENBE'S 70TH BIRTHDAY ⋮ EROL GELENBE: A CAREER IN MULTI-DISCIPLINARY PROBABILITY MODELS ⋮ 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 ⋮ Properties of stochastic syntax-directed translation schemata ⋮ On Optimal Performance in Self-Organizing Paging Algorithams ⋮ G-NETWORKS AND THEIR APPLICATIONS TO MACHINE LEARNING, ENERGY PACKET NETWORKS AND ROUTING: INTRODUCTION TO THE SPECIAL ISSUE ⋮ On the working set size and its normal approximation
