Principles of Optimal Page Replacement

DOI10.1145/321623.321632MaRDI QIDQ5621939zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(17)

• Richard Bellman's contributions to computer science
• A new approach to optimal cache scheduling
• A decomposable model of program paging behaviour
• Stochastic control of paging in a two-level computer memory
• 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
• Policies for data archival in hierarchical storage management
• A cost-based buffer replacement algorithm for object-oriented database systems
• Performance predictions for extended paged memories
• On Optimal Performance in Self-Organizing Paging Algorithams
• TPF: a dynamic system thrashing protection facility
• On the working set size and its normal approximation
• An analysis of prepaging
• A universal online caching algorithm based on pattern matching

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

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