MIN—an optimal variable-space page replacement algorithm
Communications of the ACM
Dynamic space-sharing in computer systems
Communications of the ACM
The working set model for program behavior
Communications of the ACM
Further experimental data on the behavior of programs in a paging environment
Communications of the ACM
Performance measurement of paging behavior in multiprogramming systems
ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
An inter-reference gap model for temporal locality in program behavior
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Optimal performance of distributed simulation programs
WSC '87 Proceedings of the 19th conference on Winter simulation
Long term file migration: development and evaluation of algorithms
Communications of the ACM
Generalized working sets for segment reference strings
Communications of the ACM
MIN—an optimal variable-space page replacement algorithm
Communications of the ACM
Managing Locality Sets: The Model and Fixed-Size Buffers
IEEE Transactions on Computers
A Short Theory of Multiprogramming
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
Flexible reference trace reduction for VM simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
On the BLI-model of program behaviour
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Methodology and empirical results of program behaviour measurements
PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
WSCLOCK—a simple and effective algorithm for virtual memory management
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
A critical overview of computer performance evaluation
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Experimental results on the paging behavior of numerical programs
ICSE '82 Proceedings of the 6th international conference on Software engineering
A time invariant working set model for independent reference
ACM-SE 33 Proceedings of the 33rd annual on Southeast regional conference
A Modified Working Set Paging Algorithm
IEEE Transactions on Computers
Hi-index | 48.27 |
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.