On the topological properties of the arrangement-star network

This paper proposes a new interconnection network, referred to as the arrangement-star network, which is constructed from the product of the star and arrangement networks. Studying this new network is motivated by the good qualities it exhibits over its constituent networks, the star and arrangement networks. The star network has been a research focus for quite a long time until recently when the algorithm development on the star network turned out to be cumbersome. The arrangement network as a generalized class for the star network offers no solution in that direction. The arrangement-star network, on the other hand, makes it possible to efficiently embed grids, pipelines, as well as other computationally important topologies in a very natural manner. Furthermore, the fact that the product of the star and arrangement networks comes with little increase in the network diameter and a better result on communication cost, motivates further investigation for this new alternative, the arrangement-star network.

[1]  Sanguthevar Rajasekaran,et al.  Selection, Routing, and Sorting on the Star Graph , 1997, J. Parallel Distributed Comput..

[2]  Dhiraj K. Pradhan,et al.  The Hyper-deBruijn Networks: Scalable Versatile Architecture , 1993, IEEE Trans. Parallel Distributed Syst..

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

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

[5]  Abdelmadjid Bouabdallah,et al.  Embedding Complete Binary Trees into Star Networks , 1994, MFCS.

[6]  S.W. Graham,et al.  The Cost of Broadcasting on Star Graphs and k-Ary Hypercubes , 1993, IEEE Trans. Computers.

[7]  Dilip K. Saikia,et al.  Order Preserving Communication on a Star Network , 1995, Parallel Comput..

[8]  Abdou Youssef Design and analysis of product networks , 1995, Proceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation.

[9]  Dilip K. Saikia,et al.  Two Ranking Schemes for Efficient Computation on the Star Interconnection Network , 1996, IEEE Trans. Parallel Distributed Syst..

[10]  Abdel Elah Al-Ayyoub,et al.  Node-ranking schemes for the star networks , 2003, J. Parallel Distributed Comput..

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

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

[13]  Khaled Day,et al.  Arrangement Graphs: A Class of Generalized Star Graphs , 1992, Inf. Process. Lett..

[14]  Khaled Day,et al.  The Hyperstar Interconnection Network , 1998, J. Parallel Distributed Comput..

[15]  Wei-Kuo Chiang,et al.  On the Arrangement Graph , 1998, Inf. Process. Lett..

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

[17]  A. K. Banerjee,et al.  Hyper Petersen network: yet another hypercube-like topology , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[18]  Antonio Fernández,et al.  Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation , 1994, 1994 International Conference on Parallel Processing Vol. 1.

[19]  Abdel Elah Al-Ayyoub,et al.  Matrix Decomposition on the Star Graph , 1997, IEEE Trans. Parallel Distributed Syst..

[20]  Afonso Ferreira,et al.  Optimal information dissemination in Star and Pancake networks , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

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

[22]  Arnold L. Rosenberg,et al.  Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies , 1992, Discret. Appl. Math..

[23]  Abdel Elah Al-Ayyoub,et al.  The Cross Product of Interconnection Networks , 1997, IEEE Trans. Parallel Distributed Syst..