IS AUTOMATIC FOLDING OF PROGRAMS EFFICIENT ENOUGH TO DISPLACE MANUAL

被引:10
作者
SAYRE, D
机构
[1] IBM Thomas J. Watson Research Center, Yorktown Heights, NY
关键词
automatic folding; automatic paging; demand paging; folding; measurement; memory hierarchies; paging; performance; replacement algorithms; storage hierarchies;
D O I
10.1145/363626.363629
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The operation of “folding” a program into the available memory is discussed. Measurements by Brawn et al. and by Nelson on an automatic folding mechanism of simple design, a demand paging unit built at the IBM Research Center by Belady, Nelson, O'Neill, and others, permitting its quality to be compared with that of manual folding, are discussed, and it is shown that given some care in use the unit performs satisfactorily under the conditions tested, even though it is operating across a memory-to-storage interface with a very large speed difference. The disadvantages of prefolding, which is required when the folding is manual, are examined, and a number of the important troubles which beset computing today are shown to arise from, or be aggravated by, this source. It is concluded that a folding mechanism will probably become a normal part of most computing systems. © 1969 ACM. All rights reserved.
引用
收藏
页码:656 / &
相关论文
共 9 条
[1]  
BRAWN BS, 1969, RC2276 IBM RES REP 3
[2]  
BRAWN BS, 1968, P AFIPA FJCC, V33, P1019
[3]  
BRAWN BS, 1968, RC2083 IBM RES REP 1
[4]  
BRAWN BS, 1968, RC2275 IBM RES REP 2
[5]  
LINDQUIST AB, 1966, P IEEE, V54, P1633
[6]  
MCKELLAR AC, 1968, 59 PRINC U DEP EL EN
[7]  
NELSON RA, 1968, RC2262 IBM RES REP
[8]  
ONEILL RB, UNPUBLISHED WORK
[9]  
ONEILL RW, 1967, P AFIPS, V30, P611