On the Problem of Expanding Hypercube-Based Systems

Abstract Several topologies with important features have been proposed for the interconnection of resources resident in parallel computing systems. The hypercube is one of the most widely used topologies because it provides small diameter and is so robust that it can very efficiently emulate a wide variety of other frequently used structures. Nevertheless, the major drawback of the standard hypercube is that it cannot be expanded in practice. This paper proposes a methodology that modifies hypercube networks in order to support incremental growth techniques. The proposed methodology accomplishes this goal with minimal modifications of individual hypercubes and, contrary to other existing techniques, without any need for extra resources. The effectiveness of the proposed methodology is shown analytically.

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

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

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

[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]  Angela Y. Wu,et al.  Embedding of tree networks into hypercubes , 1985, J. Parallel Distributed Comput..

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

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

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

[10]  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).

[11]  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).

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

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

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

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

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

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

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

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

[20]  Prithviraj Banerjee,et al.  Design, Analysis, and Simulation of I/O Architectures for Hypercube , 1990, IEEE Trans. Parallel Distributed Syst..

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