Hyper Petersen network: yet another hypercube-like topology

The authors propose and analyze a new hypercubelike topology, called the hyper-Petersen (HP) network, which is constructed from the Cartesian product of a binary hypercube and the Petersen graph. The properties of HP topology include regularity, a high degree of symmetry and connectivity, and a small diameter. For example, it is shown that an n-dimensional HP network with N=1.25*2/sup n/ nodes covers 2.5 times more nodes than the binary hypercube at the cost of increasing the degree by one. Furthermore, with the same degree and connectivity, the diameter of the HP network is one less than that of a hypercube, yet it has a 1.25 times higher packing density. The authors also discuss the embedding of various other topologies such as meshes, trees, and twisted hypercubes on the HP, thereby emphasizing its rich interconnection structure with a simple routing scheme for message communication. A ring of odd length can be embedded in an HP network, which is a limitation of a binary hypercube.<<ETX>>

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

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

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

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

[5]  Kemal Efe.  Programming the twisted-cube architectures , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.

[6]  Francis Y. L. Chin,et al.  On Embedding Rectangular Grids in Hypercubes , 1988, IEEE Trans. Computers.

[7]  John P. Hayes,et al.  Architecture of a Hypercube Supercomputer , 1986, ICPP.

[8]  Peter A. J. Hilbers,et al.  The Twisted Cube , 1987, PARLE.

[9]  Lionel M. Ni,et al.  On Enhancing Hypercube Multiprocessors , 1988, ICPP.

[10]  Alan S. Wagner.  Embedding all binary trees in the hypercube , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[11]  Bernd Becker,et al.  How robust is the n-cube? , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

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

[13]  Sajal K. Das,et al.  Embeddings in Recursive Combinatorial Networks , 1992, WG.

[14]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[15]  Enamul Haq.  Cross-cube: a new fault tolerant hypercube-based network , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

[16]  Charles Delorme,et al.  Strategies for Interconnection Networks: Some Methods from Graph Theory , 1986, J. Parallel Distributed Comput..

[17]  Sajal K. Das,et al.  Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems , 1992, Discret. Appl. Math..

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

[19]  Dhiraj K. Pradhan,et al.  The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI , 1989, IEEE Trans. Computers.