Home → Magazine Archive → November 1970 (Vol. 13, No. 11) → Comment on the working set model for program behavior → Abstract

Comment on the working set model for program behavior

By Arthur Bernstein

Communications of the ACM, Vol. 13 No. 11, Pages 698-699

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;(&tgr;), 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;(&tgr;). These bounds are given below.

The full text of this article is premium content


No entries found