DocumentCode
1133356
Title
A Modified Working Set Paging Algorithm
Author
Smith, Alan J.
Author_Institution
Computer Science Division, Department of Electrical Engineering and Computer Sciences, University of California
Issue
9
fYear
1976
Firstpage
907
Lastpage
914
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
Paging algorithms, page replacement algorithm, virtual memory, working set paging algorithm.; Algorithm design and analysis; Computer science; Costs; Engineering management; Memory management; Operating systems; Partitioning algorithms; Physics computing; Resists; Stability; Paging algorithms, page replacement algorithm, virtual memory, working set paging algorithm.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1976.1674715
Filename
1674715
Link To Document