A Modified Working Set Paging Algorithm

1 September 1976

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-25 (9) , 907-914
https://doi.org/10.1109/tc.1976.1674715

Abstract

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.

Keywords

This publication has 23 references indexed in Scilit:

MIN—an optimal variable-space page replacement algorithm
Communications of the ACM, 1976
A note on the calculation of average working set size
Communications of the ACM, 1974
Experimental data on page replacement algorithm
Published by Association for Computing Machinery (ACM) ,1974
Using page residency to select the working set parameter
Communications of the ACM, 1973
Properties of the working-set model
Communications of the ACM, 1972
LOCALITY: WORKING SET, REQUEST STRING, DISTANCE FUNCTION AND REPLACEMENT STACK
Published by Elsevier ,1972
Experiments with program locality
Published by Association for Computing Machinery (ACM) ,1972
Experiments on Page Size, Program Access Patterns, and Virtual Memory Performance
IBM Journal of Research and Development, 1972
Evaluation techniques for storage hierarchies
IBM Systems Journal, 1970
An algorithm for the machine calculation of complex Fourier series
Mathematics of Computation, 1965