AN ANOMALY IN SPACE-TIME CHARACTERISTICS OF CERTAIN PROGRAMS RUNNING IN A PAGING MACHINE

被引:42
作者
BELADY, LA
NELSON, RA
SHEDLER, GS
机构
[1] IBM Thomas J. Watson Research Center, Yorktowm Heights, NY
关键词
demand paging; paging machines; replacement algorithm;
D O I
10.1145/363011.363155
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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. © 1969, ACM. All rights reserved.
引用
收藏
页码:349 / &
相关论文
共 6 条
[1]   A STUDY OF REPLACEMENT ALGORITHMS FOR A VIRTUAL-STORAGE COMPUTER [J].
BELADY, LA .
IBM SYSTEMS JOURNAL, 1966, 5 (02) :78-&
[2]  
BRAWN B, 1968, RC2083 IBM CORP IB 1
[3]  
BRAWN BS, 1968, FALL AFIPS C P JOINT, V33, P1019
[4]  
FINE GH, 1966 P ACM NAT C, P223
[5]  
ONEIL RW, 1967, SPR AFIPS C P JOINT, V30, P611
[6]   DYNAMIC STORAGE ALLOCATION SYSTEMS [J].
RANDELL, B ;
KUEHNER, CJ .
COMMUNICATIONS OF THE ACM, 1968, 11 (05) :297-&