A VARIATION ON THE HYPERCUBE WITH LOWER DIAMETER

被引：238

作者：

EFE, K

机构：

[1] Center for Advanced Computer Studies, University of Southwestern Louisiana

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1991年 / 40卷 / 11期

关键词：

HYPERCUBES; INTERCONNECTION NETWORKS; GRAPH DIAMETER; PARALLEL ARCHITECTURE; SIMD COMPUTATION;

D O I：

10.1109/12.102840

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

A new interconnection structure is proposed as a basis for distributed memory parallel computer architectures. The network is a variation from the hypercube and preserves many of its desirable properties. It has the same node and link complexity, but has a diameter only about half of that of the hypercube. After a discussion of the basic properties of the proposed network, efficient routing and broadcasting algorithms are presented.

引用

页码：1312 / 1316

页数：5

共 8 条

[1]

BHUYAN LN, 1984, IEEE T COMPUT, V33, P323, DOI 10.1109/TC.1984.1676437

[2]

EFE K, 1989, 9TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, P254, DOI 10.1109/ICDCS.1989.37954

[3]

EFE K, 1990, TR9081 USL CTR ADV C

[4]

ELAMAY A, IN PRESS INT J PARAL

[5]

ESFAHANIAN A, 1988, 1988 P INT C PAR PRO, P86

[6]

Harary Frank, 1972, GRAPH THEORY

[7]

HWANG K, 1988, 2ND P FRONT MPC, P391

[8] THE CUBE-CONNECTED CYCLES - A VERSATILE NETWORK FOR PARALLEL COMPUTATION [J].

PREPARATA, FP ;

VUILLEMIN, J .

COMMUNICATIONS OF THE ACM, 1981, 24 (05) :300-309

← 1 →