Key points are not available for this paper at this time.
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.
Building similarity graph...
Analyzing shared references across papers
Loading...
Smith (Wed,) studied this question.
synapsesocial.com/papers/6a12c6b4fb24b1a422a5ecb8 — DOI: https://doi.org/10.1109/tc.1976.1674715
Smith
University of North Carolina at Chapel Hill
IEEE Transactions on Computers
Building similarity graph...
Analyzing shared references across papers
Loading...