MIN—an optimal variable-space page replacement algorithm

DOI10.1145/360051.360231zbMATH Open0322.68017OpenAlexW2058119919WikidataQ128705356 ScholiaQ128705356MaRDI QIDQ4085229FDOQ4085229

Authors: Barton G. Prieve, R. S. Fabry 

Publication date: 1976

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

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Cited In (5)

• An optimal demand prepaging algorithm
• The working set algorithm has competitive ratio less than two
• A new approach to optimal cache scheduling
• Asymptotic miss ratios over independent references
• An analysis of prepaging

This page was built for publication: MIN—an optimal variable-space page replacement algorithm

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