ADDRESSING, ROUTING, AND BROADCASTING IN HEXAGONAL MESH MULTIPROCESSORS

被引:147
作者
CHEN, MS [1 ]
SHIN, KG [1 ]
KANDLUR, DD [1 ]
机构
[1] UNIV MICHIGAN, DEPT ELECT ENGN & COMP SCI, REAL TIME COMP LAB, ANN ARBOR, MI 48109 USA
关键词
D O I
10.1109/12.46277
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:10 / 18
页数:9
相关论文
共 24 条
[1]  
Anderson G. A., 1975, Computing Surveys, V7, P197, DOI 10.1145/356654.356658
[2]  
ARDEN BW, 1981, IEEE T COMPUT, V30, P291
[3]   ON GRAPHS OF INVULNERABLE COMMUNICATION NETS [J].
BOESCH, FT ;
THOMAS, RE .
IEEE TRANSACTIONS ON CIRCUIT THEORY, 1970, CT17 (02) :183-&
[4]  
FENG T, 1981, IEEE COMPUT, V14, P12
[5]   DATA MANIPULATING FUNCTIONS IN PARALLEL PROCESSORS AND THEIR IMPLEMENTATIONS [J].
FENG, TY .
IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (03) :309-318
[6]  
FINKEL RA, 1980, IEEE T COMPUT, V29, P360, DOI 10.1109/TC.1980.1675586
[7]  
GOODMAN JR, 1981, IEEE T COMPUT, V30, P923, DOI 10.1109/TC.1981.1675731
[8]   AN ALGORITHM FOR CONSTRUCTION OF LEAST VULNERABLE COMMUNICATION NETWORK OR GRAPH WITH MAXIMUM CONNECTIVITY [J].
HAKIMI, SL .
IEEE TRANSACTIONS ON CIRCUIT THEORY, 1969, CT16 (02) :229-&
[9]  
Halin R., 1969, J COMB THEORY, V7, P150
[10]  
Harary F., 1994, GRAPH THEORY, P11, DOI [DOI 10.21236/AD0705364, 10.1201/9780429493768, DOI 10.1201/9780429493768]