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 Latest from CACM
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get InvolvedCommunications of the ACM (CACM) is now a fully Open Access publication.
By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More
Join the Discussion (0)
Become a Member or Sign In to Post a Comment