Research ArticleOpen AccessGoogle Scholar indexed
Load Balancing for Hex-Cell Interconnection Network
Department of Computer Science, King Abdullah II School for Information Technology, The University of Jordan, Amman, Jordan
Department of Computer Science, King Abdullah II School for Information Technology, The University of Jordan, Amman, Jordan
Department of Business Information Technology, King Abdullah II School for Information Technology, The University of Jordan, Amman, Jordan
- 1 Department of Computer Science, King Abdullah II School for Information Technology, The University of Jordan, Amman, Jordan
- 2 Department of Computer Science, King Abdullah II School for Information Technology, The University of Jordan, Amman, Jordan
- 3 Department of Business Information Technology, King Abdullah II School for Information Technology, The University of Jordan, Amman, Jordan
International Journal of Communications, Network and System Sciences·Volume 09 (2016)·Pages 98–116·Published 27 April 2016·DOI10.4236/ijcns.2016.94009
Copy link · social · email
Abstract
The hex-cell is one of the interconnection networks used for parallel systems. The main idea of the hex-cell is that there are hexagon cells that construct the network; each one of those cells has six nodes. The performance of the network is affected by many factors one of the factors as load balancing. Until the moment of writing of this paper, there is no load balancing algorithm for this network. The proposed algorithm for dynamic load balancing on hex-cell is based on Tree Walking Algorithm (TWA) for load balancing on tree interconnection network and the ring all to all broadcast.
KeywordsHex-CellLoad BalancingTree Walking
- Sharieh, A., Qatawneh, M., Almobaideen, W. and Sleit, A. (2008) Hex-Cell: Modeling, Topological Properties and Routing Algorithm. European Journal of Scientific Research, 22, 457-468.
- Qatawneh, M., Alamoush, A. and Alqatawna, J. (2015) Section Based Hex-Cell Routing Algorithm (SBHCR). International Journal of Computer Networks and Communications, 7, 167-177.
- Mohammad, Q. and Khattab, H. (2015) New Routing Algorithm for Hex-Cell Network. International Journal of Future Generation Communication and Networking, 8, 295-306. http://dx.doi.org/10.14257/ijfgcn.2015.8.2.24
- Shu, W. and Wu, M.-Y. (1995) An Incremental Parallel Scheduling Approach for Solving Dynamic and Irregular Problems. Proceedings of the 24th International Conference on Parallel Processing, Oconomowoc, 4 October 1995, 143-150.
- Grama, A., Gupta, A., Karypis, G. and Kumar, V. (2003) Introduction to Parallel Computing. 2nd Edition, Chapter 4. Basic Communication Operations, Section 4.2 All-to-All Broadcast and Reduction, Subject 4.2.1 Linear Array and Ring.