Thumbnail
Access Restriction
Subscribed

Author Bernstein, Arthur
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
Language English
Subject Keyword Demand paging ♦ Working set ♦ Multiprogramming ♦ Paging rate
Abstract In the paper “The Working Set Model for Program Behavior” by Peter Denning [Comm. ACM 11, 5 (May 1968), 323-333], an algorithm is described for the management of a paged memory under demand paging. In the process of analyzing this model, the author presents what appears to be an incorrect expression for &PHgr;(τ), the real-time rate at which page faults occur in the system [eq. (13)]. Under the assumptions made in the article it appears that the best one can do in this area is to place an upper and lower bound on &PHgr;(τ). These bounds are given below.
Description Affiliation: State Univ. of New York at Stony Brook, Stony Brook (Bernstein, Arthur)
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 13
Issue Number 11
Page Count 2
Starting Page 698
Ending Page 699


Open content in new tab

   Open content in new tab
Source: ACM Digital Library