The Load Balancing Algorithm for the Star Interconnection Network

The star network is one of the promising interconnection networks for future high speed parallel computers, it is expected to be one of the future-generation networks. The star network is both edge and vertex symmetry, it was shown to have many gorgeous topological proprieties also it is owns hierarchical structure framework. Although much of the research work has been done on this promising network in literature, it still suffers from having enough algorithms for load balancing problem. In this paper we try to work on this issue by investigating and proposing an efficient algorithm for load balancing problem for the star network. The proposed algorithm is called Star Clustered Dimension Exchange Method SCDEM to be implemented on the star network. The proposed algorithm is based on the Clustered Dimension Exchange Method (CDEM). The SCDEM algorithm is shown to be efficient in redistributing the load balancing as evenly as possible among all nodes of different factor networks. Keywords—Interconnection networks, Load balancing, Star network.

[1]  Sartaj Sahni,et al.  Programming a hypercube multicomputer , 1988, IEEE Software.

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

[3]  Jehad Al-Sadi Implementing FEFOM Load Balancing Algorithm on the Enhanced OTIS-n-Cube Topology , 2013 .

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

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

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

[7]  Yong Qin,et al.  GDED-X Schemes for Load Balancing on Heterogeneous OTIS-Networks , 2007, ICA3PP.

[8]  Basel A. Mahafzah,et al.  The load balancing problem in OTIS-Hypercube interconnection networks , 2008, The Journal of Supercomputing.

[9]  S. K. Dhall,et al.  Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems , 1990 .

[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]  Sanguthevar Rajasekaran,et al.  Selection, Routing, and Sorting on the Star Graph , 1997, J. Parallel Distributed Comput..

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

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

[15]  Selim G. Akl,et al.  Perfect load balancing on the star interconnection network , 2007, The Journal of Supercomputing.

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

[17]  Yong Qin,et al.  Hybrid Diffusion Schemes for Load Balancing on OTIS-Networks , 2007, ICA3PP.

[18]  Abdel Elah Al-Ayyoub,et al.  Comparative Study of Cartesian Product Networks , 1996, PDPTA.