MIN—an optimal variable-space page replacement algorithm
From MaRDI portal
Publication:4085229
DOI10.1145/360051.360231zbMath0322.68017OpenAlexW2058119919WikidataQ128705356 ScholiaQ128705356MaRDI QIDQ4085229
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
Formal languages and automata (68Q45) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (5)
The working set algorithm has competitive ratio less than two ⋮ An analysis of prepaging ⋮ A new approach to optimal cache scheduling ⋮ Asymptotic miss ratios over independent references ⋮ An optimal demand prepaging algorithm
This page was built for publication: MIN—an optimal variable-space page replacement algorithm
