Hierarchical star: a new two level interconnection network

We propose a new two level interconnection network topology, hierarchical star networks, HSn, that uses the star graphs as building blocks. Two level networks have been previously proposed that use hypercube and its variants as building blocks; it has been shown that these two level networks are superior to the networks, that are used as bnilding blocks, in terms of various performance metrics including diameter, cost, fault tolerance, fault diameter etc. Our results show that the proposed family of hierarchical star networks perform very competitively in comparison to star graphs; in addition, the proposed network outperforms all of the two level hierarchical networks proposed earlier that uses hypercubes (or its variations) as building blocks. Thus, our results further reinforce the notion that the star graphs are strong competitors of hypercubes for large multiprocessor design. We also investigate various topological properties of the network including embedding, mapping of parallel algorithms, fault tolerance and broadcasting algorithms.

[1]  S. Lakshmivarahan,et al.  Embedding of cycles and grids in star graphs , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[2]  S. Lakshmivarahan,et al.  Embedding of cycles and Grids in Star Graphs , 1991, J. Circuits Syst. Comput..

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

[4]  Shietung Peng,et al.  Metacube: a new interconnection network for large scale parallel systems , 2002 .

[5]  Dilip Sarkar,et al.  Optimal Broadcasting on the Star Graph , 1992, IEEE Trans. Parallel Distributed Syst..

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

[7]  Arun K. Somani,et al.  An Efficient Sorting Algorithm for the Star Graph Interconnection Network , 1990, ICPP.

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

[9]  Selim G. Akl,et al.  Decomposing a Star Graph Into Disjoint Cycles , 1991, Inf. Process. Lett..

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

[11]  Selim G. Akl,et al.  A Parallel Algorithm for Computing Fourier Transforms on the Star Graph , 1994, IEEE Trans. Parallel Distributed Syst..

[12]  Selim G. Akl,et al.  On Some Properties and Algorithms for the Star and Pancake Interconnection Networks , 1994, J. Parallel Distributed Comput..

[13]  Khaled Day,et al.  A Comparative Study of Topological Properties of Hypercubes and Star Graphs , 1994, IEEE Trans. Parallel Distributed Syst..

[14]  Pradip K. Srimani,et al.  Fault Diameter of Star Graphs , 1993, Inf. Process. Lett..

[15]  Sartaj Sahni,et al.  Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs , 1990, ICPP.

[16]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

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

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

[19]  Jywe-Fei Fang,et al.  Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules , 1995, IEEE Trans. Parallel Distributed Syst..