Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules

In this paper, a new two-level interconnection network, called a hierarchical folded-hypercube network (HFN, for short), is proposed. The HFN takes folded hypercubes as basic modules which are connected in a complete manner. We investigate the topological properties of the HFN, including the diameter, cost, average distance, embedding, connectivity, container, /spl kappa/-wide diameter, and node-fault diameter. We show that the HFN can emulate algorithms which are executable on the ring or the mesh-connected computer with the same time complexities in big-O notation. Moreover, the HFN can embed a folded hypercube having the same number of nodes with constant dilation. We compute the diameter, node connectivity, best container, /spl kappa/-wide diameter, and node-fault diameter of the HFN. We present optimal routing and broadcasting algorithms for the HFN. The semigroup computation and descend/ascend algorithms can be executed as well on the HFN. >

[1]  Jimmie Gilbert,et al.  Elements of Modern Algebra , 1984 .

[2]  Kanad Ghose,et al.  The Design and Evaluation of the Hierarchical Cubic Network , 1990, ICPP.

[3]  Bernard L. Menezes,et al.  The KYKLOS Multicomputer Network: Interconnection Strategies, Properties, and Applications , 1991, IEEE Trans. Computers.

[4]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

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

[6]  Kanad Ghose,et al.  Hierarchical Cubic Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[7]  Sivarama P. Dandamudi,et al.  Hierarchical Interconnection Networks for Multicomputer Systems , 1990, IEEE Trans. Computers.

[8]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

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

[10]  Bhagirath Narahari,et al.  The Banyan-Hypercube Networks , 1990, IEEE Trans. Parallel Distributed Syst..

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

[12]  Mohan Kumar,et al.  Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes , 1992, IEEE Trans. Parallel Distributed Syst..

[13]  C. Sanges,et al.  A recursively scalable network VLSI implementation , 1988, Future Gener. Comput. Syst..

[14]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[15]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[16]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[17]  Ming-Syan Chen,et al.  Processor Allocation in an N-Cube Multiprocessor Using Gray Codes , 1987, IEEE Transactions on Computers.

[18]  Shahram Latifi,et al.  Bridged Hypercube Networks , 1990, J. Parallel Distributed Comput..

[19]  L. W. Tucker,et al.  Architecture and applications of the Connection Machine , 1988, Computer.

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

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

[22]  Kai Hwang,et al.  Hypernet: A Communication-Efficient Architecture for Constructing Massively Parallel Computers , 1987, IEEE Transactions on Computers.

[23]  M. Krishnamoorthy,et al.  Fault diameter of interconnection networks , 1987 .

[24]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.