Affiliation:
1. Faculté de Mathématiques et d'Informatique, Université de Picardie Jules Verne, 33 Rue Saint-Leu Amiens, 80039 Cedex 1, France
Abstract
This paper presents two simple all-to-all broadcasting algorithms on honeycomb mesh. Consider a network with n processors, one has personalized routing strategy at each node and it requires a 3n communication time complexity. This communication time can be reduced to n because the computation time is always assumed to be much lower than the communication time. The other is based on a Hamiltonian path and has a 2n communication time complexity. We show how they can be used to get parallel solutions to a class of problems on honeycomb networks, among others Prefix Sums, Maximal Vectors, Maximal Sum Subsegment, Parenthesis Matching, Decoding Binary Tree, and Sorting. In our knowledge, these all-to-all broadcast algorithms are the only ones so far exhibited on a honeycomb.
Publisher
World Scientific Pub Co Pte Lt
Subject
Hardware and Architecture,Theoretical Computer Science,Software
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Some Topological Properties of the Honeycomb Rhombic Torus Based on Cayley Graph;Proceedings of the 2019 11th International Conference on Machine Learning and Computing - ICMLC '19;2019
2. The new Petersen-torus networks;The Journal of Supercomputing;2014-11-25
3. Broadcasting Algorithms of Three-Dimensional Petersen-Torus Network;Journal of Applied Mathematics;2014
4. PI Index of Mesh Structured Chemicals;Informatics Engineering and Information Science;2011
5. Ring embedding in faulty generalized honeycomb torus – GHT(m, n, n/2);International Journal of Computer Mathematics;2010-12