ROUTING TECHNIQUES FOR MASSIVELY PARALLEL COMMUNICATION

被引:14
作者
FELPERIN, SA
GRAVANO, L
PIFARRE, GD
SANZ, JLC
机构
[1] IBM COR,ALMADEN RES CTR,RES LAB,DEPT COMP SCI,SAN JOSE,CA 95120
[2] ESCUELA SUPER LATINO AMER INFORMAT,RA-1000 BUENOS AIRES,ARGENTINA
[3] UNIV CALIF DAVIS,COMP VIS RES LAB,DAVIS,CA 95616
关键词
D O I
10.1109/5.92043
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, a survey of some packet-switched routing methods for massively parallel computers is presented. Some of the techniques are applicable to both shared-memory and message-passing architectures. These routing methods are compared in terms of their efficiency in mapping to parallel machines, network delays and interconnection topologies, deadlock and livelock freedom, and adaptivity to network congestion.
引用
收藏
页码:488 / 503
页数:16
相关论文
共 40 条
[1]  
ATHAS WC, 1988, IEEE COMPUT, V21, P9
[2]  
BIRK Y, 1989, RJ707867141 IBM ALM
[3]  
BORODIN A, 1982, 14TH P ACM S THEOR C, P338
[4]  
DALLY W, 1986, CALTECH5206TR86 COMP
[5]  
FELPERIN S, 1991, SIMULATION RESULTS P
[6]  
FELPERIN S, 1990, IBM TR9001 COMP RES
[7]  
FULGHAM M, 1990, COMPARISON SIMD HYPE
[8]  
GELERNTER D, 1981, IEEE T COMPUT, V30, P709, DOI 10.1109/TC.1981.1675690
[9]  
GIBBONS P, 1989, RJ721867985 IBM ALM
[10]  
GUNTHER K, 1981, IEEE T COMMUN, V29