Thumbnail
Access Restriction
Subscribed

Author Schwartz, Stuart C. ♦ Denning, Peter J.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Paging algorithms ♦ Paging ♦ Working-set model ♦ Program modeling ♦ Program behavior
Abstract A program's working set W(t, T) at time t is the set of distinct pages among the T most recently referenced pages. Relations between the average working-set size, the missing-page rate, and the interreference-interval distribution may be derived both from time-average definitions and from ensemble-average (statistical) definitions. An efficient algorithm for estimating these quantities is given. The relation to LRU (lease recently used) paging is characterized. The independent-reference model, in which page references are statistically independent, is used to assess the effects of interpage dependencies on working-set size observations. Under general assumptions, working-set size is shown to be normally distributed.
Description Affiliation: Princeton Univ., Princeton, NJ (Denning, Peter J.; Schwartz, Stuart C.)
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 15
Issue Number 3
Page Count 8
Starting Page 191
Ending Page 198


Open content in new tab

   Open content in new tab
Source: ACM Digital Library