Thumbnail
Access Restriction
Subscribed

Author Shedler, G. S. ♦ Nelson, R. A. ♦ Belady, L. A.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Demand paging ♦ Paging machines ♦ Replacement algorithm
Abstract The running time of programs in a paging machine generally increases as the store in which programs are constrained to run decreases. Experiment, however, have revealed cases in which the reverse is true: a decrease in the size of the store is accompanied by a decrease in running time.An informal discussion of the anomalous behavior is given, and for the case of the FIFO replacement algorithm a formal treatment is presented.
Description Affiliation: IBM Thomas J. Watson Research Center, Yorktowm Heights, NY (Belady, L. A.; Nelson, R. A.; Shedler, G. S.)
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 12
Issue Number 6
Page Count 5
Starting Page 349
Ending Page 353


Open content in new tab

   Open content in new tab
Source: ACM Digital Library