The Community for Technology Leaders
Green Image
Issue No. 11 - November (1991 vol. 40)
ISSN: 0018-9340
pp: 1312-1316
<p>A new interconnection structure is proposed as a basis for distributed-memory parallel computer architectures. The network is a variation of the hypercube and preserves many of its desirable properties, including regularity and large vertex connectivity. It has the same node and link complexity, but has a diameter only about half of the hypercube's. Some of the basic properties of this topology are discussed. Efficient routing and broadcasting algorithms are presented.</p>
hypercube; interconnection structure; distributed-memory parallel computer architectures; regularity; large vertex connectivity; link complexity; routing; broadcasting algorithms; hypercube networks; parallel architectures.

K. Efe, "A Variation on the Hypercube with Lower Diameter," in IEEE Transactions on Computers, vol. 40, no. , pp. 1312-1316, 1991.
89 ms
(Ver 3.3 (11022016))