This Article 
 Bibliographic References 
 Add to: 
A Modified Working Set Paging Algorithm
September 1976 (vol. 25 no. 9)
pp. 907-914
A.J. Smith, Computer Science Division, Department of Electrical Engineering and Computer Sciences, University of California
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.
Index Terms:
Paging algorithms, page replacement algorithm, virtual memory, working set paging algorithm.
A.J. Smith, "A Modified Working Set Paging Algorithm," IEEE Transactions on Computers, vol. 25, no. 9, pp. 907-914, Sept. 1976, doi:10.1109/TC.1976.1674715
Usage of this product signifies your acceptance of the Terms of Use.