Issue No. 01 - January (2012 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.112
Bader Albader , Kuwait University, Safat
Bella Bose , Oregon State University, Corvallis
Mary Flahive , Oregon State University, Corvallis
In this paper, we show that the hexagonal mesh networks developed in the early 1990s are a special case of the EJ networks that have been considered more recently. Using a node addressing scheme based on the EJ number system, we give a shortest path routing algorithm for hexagonal mesh networks. We also extend the known efficient one-to-all broadcasting algorithm on hexagonal mesh networks to algorithms for one-to-one personalized broadcasting, all-to-all broadcasting, and all-to-all personalized broadcasting algorithms. Their time complexity and optimality are analyzed.
Parallel processing, interconnection networks, hexagonal mesh networks, EJ networks, broadcasting, communication algorithms.
B. Bose, M. Flahive and B. Albader, "Efficient Communication Algorithms in Hexagonal Mesh Interconnection Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 69-77, 2011.