COMMUNICATION ASPECTS OF THE STAR GRAPH INTERCONNECTION NETWORK

被引：21

作者：

MISIC, J ^{[1
]}

JOVANOVIC, Z ^{[1
]}

机构：

[1] UNIV BELGRADE,DEPT COMP SCI,YU-11001 BELGRADE,YUGOSLAVIA

来源：

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | 1994年 / 5卷 / 07期

关键词：

COMMUNICATION ALGORITHMS; INTERCONNECTION NETWORKS; MULTICOMPUTERS; CAYLEY GRAPHS; STAR GRAPH;

D O I：

10.1109/71.296314

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Basic communication algorithms for star graph interconnection networks are developed by using the hierarchical properties or the star graph, with the assumption that one input channel can drive only one output communication channel at a time. With this constraint, communication algorithms for each node can be expressed only as sequences of generators corresponding to the communication channels. Sequences that are identical exploit the symmetry and hierarchical properties of the star graph and can be easily integrated in communication hardware. Their time complexities are evaluated and compared with the corresponding results for the hypercube.

引用

页码：678 / 687

页数：10

共 16 条

[1]

Akers S. B., 1987, Proceedings of the 1987 International Conference on Parallel Processing, P393

[2] A GROUP-THEORETIC MODEL FOR SYMMETRIC INTERCONNECTION NETWORKS [J].

AKERS, SB ;

KRISHNAMURTHY, B .

IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (04) :555-566

[3]

AKERS SB, 1987, 2ND P INT C SUP, V3, P270

[4]

Bertsekas D.P., 1989, PARALLEL DISTRIBUTED

[5]

CHIEN AA, 1992, 19TH P ANN INT S COM, P268

[6]

CHITTOR S, 1990, 1990 P INT C PAR PRO, V1, P424

[7]

DALLY WJ, 1987, IEEE T COMPUT, V36, P547, DOI 10.1109/TC.1987.1676939

[8]

DALLY WJ, 1990, 17TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, P60, DOI 10.1109/ISCA.1990.134508

[9]

GLASS CJ, 1992, 19TH P INT S COMP AR, P278

[10]

HSU JM, 1990, 1990 P INT C PAR PRO, V1, P508

← 1 2 →