Affiliation:
1. Bell Lab, Naperville, IL
2. Univ. of California, Berkeley
Abstract
A criterion for comparing variable space page replacement algorithms is presented. An optimum page replacement algorithm, called VMIN, is described and shown to be optimum with respect to this criterion. The results of simulating VMIN, Denning's working set, and the page partitioning replacement algorithms on five virtual memory programs are presented to demonstrate the improvement possible over the known realizable variable space algorithms.
Publisher
Association for Computing Machinery (ACM)
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bibliography;Storage Systems;2022
2. Introduction;Storage Systems;2022
3. Working Set Analytics;ACM Computing Surveys;2021-11-30
4. Beating OPT with Statistical Clairvoyance and Variable Size Caching;Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems;2019-04-04
5. PAYJIT: space-optimal JIT compilation and its practical implementation;Proceedings of the 27th International Conference on Compiler Construction;2018-02-24