ACM Computing Surveys (CSUR)
A study of storage partitioning using a mathematical model of locality
Communications of the ACM
Properties of the working-set model
Communications of the ACM
Resource management for a medium scale time-sharing operating system
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
Measurement and analysis of a demand paging Time Sharing System
ACM '69 Proceedings of the 1969 24th national conference
Dynamic program behavior under paging
ACM '66 Proceedings of the 1966 21st national conference
An Adaptive Replacement Algorithm for Paged-Memory Computer Systems
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
Scheduling TSS/360 for responsiveness
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
The page fault frequency replacement algorithm
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Experiments with program locality
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
The GM multiple console time sharing system
ACM SIGOPS Operating Systems Review
A Modified Working Set Paging Algorithm
IEEE Transactions on Computers
Working Set and Page Fault Frequency Paging Algorithms: A Performance Comparison
IEEE Transactions on Computers
On modeling contention for shared caches in multi-core processors with techniques from ecology
Natural Computing: an international journal
| Hi-index | 0.01 |
Although paged VM (Virtual Memory) systems are being implemented more and more, their full capabilities have not yet been realized. Early research in this field pointed to possible inefficiencies in their implementation. Subsequent studies, however, led to the conclusion that paged VM systems could provide a productive means to run large programs on small main memory, if proper techniques are employed. One of the most influential of these is the choice of an efficient page replacement algorithm (RA) to minimize page traffic between the different levels of memory.