Principles of Optimal Page Replacement
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
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
Is automatic “folding” of programs efficient enough to displace manual?
Communications of the ACM
Microprogamming under a page on demand strategy
Communications of the ACM
Dynamic program behavior under paging
ACM '66 Proceedings of the 1966 21st national conference
An empirical study of the behavior of programs in a paging environment
SOSP '67 Proceedings of the first ACM symposium on Operating System Principles
Adaptive replacement algorithms for use in paged memory computer systems
Adaptive replacement algorithms for use in paged memory computer systems
A Dynamic Memory Allocation Algorithm
IEEE Transactions on Computers
On Static Memory Allocation in Computer Systems
IEEE Transactions on Computers
Factors Affecting the Efficiency of A Virtual Memory
IEEE Transactions on Computers
Thrashing: its causes and prevention
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
Experimental data on page replacement algorithm
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
| Hi-index | 14.98 |
A general class of adaptive replacement schemes for use in paged memories is developed. One such algorithm, called SIM, is simulated using a probability model that generates memory traces, and the results of the simulation of this adaptive scheme are compared with those obtained using the best nonlookahead algorithms. A technique for implementing this type of adaptive replacement algorithm with state of the art digital hardware is also presented.