Thumbnail
Access Restriction
Subscribed

Author Slutz, Donald R. ♦ Denning, Peter J.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Segmentation ♦ Memory management ♦ Paging ♦ Optimal memory policies ♦ Program measurement ♦ Working sets ♦ Database referencing ♦ Program behavior
Abstract The working-set concept is extended for programs that reference segments of different sizes. The generalized working-set policy (GWS) keeps as its resident set those segments whose retention costs do not exceed their retrieval costs. The GWS is a model for the entire class of demand-fetching memory policies that satisfy a resident-set inclusion property. A generalized optimal policy (GOPT) is also defined; at its operating points it minimizes aggregated retention and swapping costs. Special cases of the cost structure allow GWS and GOPT to simulate any known stack algorithm, the working set, and VMIN. Efficient procedures for computing demand curves showing swapping load as a function of memory usage are developed for GWS and GOPT policies. Empirical data from an actual system are included.
Description Affiliation: Purdue Univ., West Lafayette, IN (Denning, Peter J.) || IBM, San Jose, CA (Slutz, Donald R.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 21
Issue Number 9
Page Count 10
Starting Page 750
Ending Page 759


Open content in new tab

   Open content in new tab
Source: ACM Digital Library