Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2017.081225
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 8 Issue 12, 2017.
Abstract: The tree-hypercube (TH) interconnection network is relatively a new interconnection network, which is constructed from tree and hypercube topologies. TH is developed to support parallel algorithms for solving computation and communication intensive problems. In this paper, we propose a new parallel multiplication algorithm on TH network to present broadcast communication operation for TH using store-and-forward technique, namely, one-to-all broadcast operation which allows a message to be transmitted through the shortest path from the source node to all other nodes. The proposed algorithm is implemented and evaluated in terms of running time, efficiency and speedup with different data size using IMAN1. The experimental results show that the runtime, efficiency and the speedup of the proposed algorithm decrease as a number of processors increases for all cases of matrices size of 1000?1000, 2000?2000, and 4000?4000.
Orieb AbuAlghanam, Mohammad Qatawneh, Hussein A. al Ofeishat, Omar Adwan and Ammar Huneiti, “A New Parallel Matrix Multiplication Algorithm on Tree-Hypercube Network using Iman1 Supercomputer” International Journal of Advanced Computer Science and Applications(IJACSA), 8(12), 2017. http://dx.doi.org/10.14569/IJACSA.2017.081225