Thumbnail
Access Restriction
Subscribed

Author Prieve, Barton G. ♦ Fabry, R. S.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Locality ♦ Memory management ♦ Program behavior
Abstract A criterion for comparing variable space page replacement algorithms is presented. An optimum page replacement algorithm, called VMIN, is described and shown to be optimum with respect to this criterion. The results of simulating VMIN, Denning's working set, and the page partitioning replacement algorithms on five virtual memory programs are presented to demonstrate the improvement possible over the known realizable variable space algorithms.
Description Affiliation: Univ. of California, Berkeley (Fabry, R. S.) || Bell Lab, Naperville, IL (Prieve, Barton G.)
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 19
Issue Number 5
Page Count 3
Starting Page 295
Ending Page 297


Open content in new tab

   Open content in new tab
Source: ACM Digital Library