RH: A Versatile Family of Reduced Hypercube Interconnection Networks

The binary hypercube has been one of the most frequently chosen interconnection networks for parallel computers because it provides low diameter and is so robust that it can very efficiently emulate a wide variety of other frequently used networks. However, the major drawback of the hypercube is the increase in the number of communication channels for each processor with an increase in the total number of processors in the system. This drawback has a direct effect on the very large scale integration complexity of the hypercube network. This short note proposes a new topology that is produced from the hypercube by a uniform reduction in the number of edges for each node. This edge reduction technique produces networks with lower complexity than hypercubes while maintaining, to a high extent, the powerful hypercube properties. An extensive comparison of the proposed reduced hypercube (RH) topology with the conventional hypercube is included. It is also shown that several copies of the popular cube-connected cycles network can be emulated simultaneously by an RH with dilation 1. >

[1]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[2]  Teemu Kerola,et al.  Operational Analysis on Hyper-Rectangulars , 1988, ICPP.

[3]  Sotirios G. Ziavras,et al.  Pyramid mappings onto hypercubes for computer vision: Connection machine comparative study , 1993, Concurr. Pract. Exp..

[4]  Charles L. Seitz,et al.  Concurrent VLSI Architectures , 1984, IEEE Transactions on Computers.

[5]  Pen-Chung Yew,et al.  An Enhancement Scheme for Hypercube Interconnection Networks , 1987, ICPP.

[6]  Shahram Latifi,et al.  Properties and Performance of Folded Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..

[7]  Sotirios G. Ziavras,et al.  Processor allocation for a class of hypercube-like supercomputers , 1992, Proceedings Supercomputing '92.

[8]  Nian-Feng Tzeng,et al.  Enhanced Incomplete Hypercubes , 1989, ICPP.

[9]  Yousef Saad,et al.  Multigrid Algorithms on the Hypercube Multiprocessor , 1986, IEEE Transactions on Computers.

[10]  Ten-Hwang Lai,et al.  Mapping Pyramid Algorithms into Hypercubes , 1990, J. Parallel Distributed Comput..

[11]  Prithviraj Banerjee.  The Cubical Ring Connected Cycles: A Fault-Tolerant Parallel Computation Network , 1988, IEEE Trans. Computers.

[12]  Howard P. Katseff,et al.  Incomplete Hypercubes , 1988, IEEE Trans. Computers.

[13]  Kanad Ghose,et al.  The HCN: a versatile interconnection network based on cubes , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[14]  Roy M. Jenevein,et al.  Scaleability of a Binary Tree on a Hypercube , 1986, ICPP.

[15]  William J. Dally,et al.  Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels , 1993, IEEE Trans. Parallel Distributed Syst..

[16]  Arun K. Somani,et al.  The generalized folding-cube network , 1991, Networks.

[17]  Arun K. Somani,et al.  The Generalized Folding-Cube , 1990, ICPP.

[18]  Kemal Efe,et al.  The Crossed Cube Architecture for Parallel Computation , 1992, IEEE Trans. Parallel Distributed Syst..

[19]  Nian-Feng Tzeng,et al.  Embeddings in Incomplete Hypercubes , 1990, ICPP.

[20]  P. F. Corbett,et al.  Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks , 1992, IEEE Trans. Parallel Distributed Syst..

[21]  Lionel M. Ni,et al.  The Twisted N-Cube with Application to Multiprocessing , 1991, IEEE Trans. Computers.

[22]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[23]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[24]  Sotirios G. Ziavras.  On the Problem of Expanding Hypercube-Based Systems , 1992, J. Parallel Distributed Comput..

[25]  Krishnan Padmanabhan,et al.  An Analysis of the Twisted Cube Topology , 1989, ICPP.

[26]  Larry D. Wittie,et al.  Communication Structures for Large Networks of Microcomputers , 1981, IEEE Transactions on Computers.

[27]  S. Johnsson,et al.  Spanning balanced trees in Boolean cubes , 1989 .