MIN—an optimal variable-space page replacement algorithm
Communications of the ACM
A note on the calculation of average working set size
Communications of the ACM
Properties of the working-set model
Communications of the ACM
Demand paging through utilization of working sets onr the MANIAC II
Communications of the ACM
Using page residency to select the working set parameter
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
Time Series Analysis, Forecasting and Control
Time Series Analysis, Forecasting and Control
The VMOS paging algorithm: a practical implementation of the working set model
ACM SIGOPS Operating Systems Review
Performance analysis of computer systems components.
Performance analysis of computer systems components.
Program behavior in a paging environment
AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring 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
Experimental data on page replacement algorithm
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
Experiments on page size, program access patterns, and virtual memory performance
IBM Journal of Research and Development
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
Evaluation techniques for storage hierarchies
IBM Systems Journal
On-line measurement of paging behavior by the multivalued MIN algorithm
IBM Journal of Research and Development
Empirically derived micromodels for sequences of page exceptions
IBM Journal of Research and Development
A Short Theory of Multiprogramming
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
On the Performance Enhancement of Paging Systems Through Program Analysis and Transformations
IEEE Transactions on Computers
| Hi-index | 14.98 |
The working set paging algorithm is known to be highly efficient, yet has the disadvantage that during changes of locality large numbers of pages are accumulated in memory Unnecessarily. The author proposes a modification of the working set algorithm called the damped working set(DWS)algorithm which resists sudden expansion of working set size and exhibits far greater stability in the number of page frames-allocated to an active process. Program address traces are analyzed to determine the effectiveness of the DWS algorithm.