Principles of Optimal Page Replacement

DOI10.1145/321623.321632zbMath0217.53504OpenAlexW1985264830MaRDI QIDQ5621939

A. V. Aho, Peter J. Denning, Jeffrey D. Ullman

Publication date: 1971

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321623.321632

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Theory of operating systems (68N25)

Related Items (18)

Richard Bellman's contributions to computer science ⋮ A universal online caching algorithm based on pattern matching ⋮ An analysis of prepaging ⋮ A new approach to optimal cache scheduling ⋮ On the smoothness of paging algorithms ⋮ A decomposable model of program paging behaviour ⋮ Stochastic control of paging in a two-level computer memory ⋮ TPF: a dynamic system thrashing protection facility ⋮ Optimal control of demand-paging systems ⋮ Asymptotic miss ratios over independent references ⋮ Multiprogramming with virtual memory - a queueing model ⋮ On the paging-complexity of periodic arrangements ⋮ FIFO-optimal placement on pages of independently referenced sectors ⋮ Performance predictions for extended paged memories ⋮ On Optimal Performance in Self-Organizing Paging Algorithams ⋮ Policies for data archival in hierarchical storage management ⋮ A cost-based buffer replacement algorithm for object-oriented database systems ⋮ On the working set size and its normal approximation

This page was built for publication: Principles of Optimal Page Replacement