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

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

Cited in

(17)

• Multiprogramming with virtual memory - a queueing model
• FIFO-optimal placement on pages of independently referenced sectors
• 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
• A universal online caching algorithm based on pattern matching
• A new approach to optimal cache scheduling
• Asymptotic miss ratios over independent references
• An analysis of prepaging
• Richard Bellman's contributions to computer science
• On the working set size and its normal approximation
• Performance predictions for extended paged memories
• A decomposable model of program paging behaviour
• Stochastic control of paging in a two-level computer memory
• Optimal control of demand-paging systems
• On the paging-complexity of periodic arrangements
• TPF: a dynamic system thrashing protection facility

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)