All-to-All Broadcasting Algorithms on Honeycomb Networks and Applications

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.

[1]  Eli Upfal,et al.  Efficient Algorithms for All-to-All Communications in Multiport Message-Passing Systems , 1997, IEEE Trans. Parallel Distributed Syst..

[2]  Shmuel Zaks,et al.  Lexicographic Generation of Ordered Trees , 1980, Theor. Comput. Sci..

[3]  A. Gamst,et al.  Homogeneous distribution of frequencies in a regular hexagonal cell system , 1982, IEEE Transactions on Vehicular Technology.

[4]  Ivan Stojmenovic,et al.  Honeycomb Networks: Topological Properties and Communication Algorithms , 1997, IEEE Trans. Parallel Distributed Syst..

[5]  Jurij Silc,et al.  High-Performance Computing on a Honeycomb Architecture , 1993, ACPC.

[6]  Uyless Black.  Mobile and wireless networks , 1996 .

[7]  Selim G. Akl,et al.  Broadcasting with Selective Reduction , 1989, IFIP Congress.

[8]  David C. Mason,et al.  A digital geometry for hexagonal pixels , 1989, Image Vis. Comput..

[9]  Stephan Olariu,et al.  Optimal Parallel Encoding and Decoding Algorithms for Trees , 1992, Int. J. Found. Comput. Sci..

[10]  Vijay K. Garg,et al.  Wireless and Personal Communications Systems , 2000 .

[11]  L. Yong-Kui,et al.  The Generation of Circular Arcs on Hexagonal Grids , 1993, Comput. Graph. Forum.

[12]  V. Milutinovic.  Mapping of neural networks on the honeycomb architecture , 1989 .

[13]  Selim G. Akl.  Parallel computation: models and methods , 1997 .

[14]  Lewis Neale Lester,et al.  Computer graphics on a hexagonal grid , 1984, Comput. Graph..

[15]  Ivan Stojmenovic,et al.  Enumeration of Polyhex Hydrocarbons to h = 17 , 1995, J. Chem. Inf. Comput. Sci..

[16]  Ivan Stojmenovic,et al.  Constant Time BSR Solutions to Parenthesis Matching, Tree Decoding, and Tree Reconstruction From Its Traversals , 1996, IEEE Trans. Parallel Distributed Syst..