This Article 
 Bibliographic References 
 Add to: 
Fast Gossiping on Mesh-Bus Computers
November 1996 (vol. 45 no. 11)
pp. 1326-1330

Abstract—A mesh-bus computer is a parallel computer in which nodes (i.e., processors) are arranged on a two-dimensional array, and nodes on each row and nodes on each column, respectively, are connected by a shared bus. The nodes communicate with each other by exchanging packets through shared buses in CREW manner. Suppose that each node initially contains a piece of information called a token. A gossiping problem is the routing problem of exchanging tokens among all nodes in the computer, which has been studied extensively as a basic communication scheme for sharing information among nodes in a parallel computer. In this paper, we propose three gossiping algorithms for mesh-bus computers assuming that each packet can carry at most $\ell$ tokens in a step, where $\ell$ is a function of the number of all nodes. It is shown that by selecting the fastest algorithm among them, for each given function $\ell$, a lower bound on the gossiping time can be attained asymptotically.

[1] A. Bar-Noy and D. Peleg, "Square Meshes Are Not Always Optimal," IEEE Trans. Computers, vol. 40, pp. 196-204, 1991
[2] Y.C. Chen, W.T. Chen, G.H. Chen, and J.P. Sheu, "Designing Efficient Parallel Algorithms on Mesh Connected Computers with Multiple Broadcasting," IEEE Trans. Parallel and Distributed Systems, vol. 1, pp. 241-246, 1990.
[3] S. Cheung and F.C.M. Lau, "A Lower Bound for Permutation Routing on Two-Dimensional Bused Meshes," Information Processing Letters, vol. 45, pp. 225-228, Apr. 1993.
[4] S. Fujita and M. Yamashita, "Optimal Gossiping in Mesh-Bus Computers," Parallel Processing Letters, vol. 3, pp. 357-361, 1993.
[5] J.R. Goodman and P.J. Woest, “The Wisconsin Multicube: A New Large-Scale Cache-Coherent Multiprocessor,” Proc. 15th Ann. Int'l Symp. Computer Architecture, pp. 422-431, 1988.
[6] S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, "A Survey of Gossiping and Broadcasting in Communication Networks," Networks, vol. 18, pp. 319-349, 1988.
[7] K. Iwama and Y. Kambayashi, "An O(log n) Parallel Connectivity Algorithm on the Mesh of Buses," Proc. IFIP 11th World Computer Congress, pp. 305-310, 1989.
[8] K. Iwama, E. Miyano, and Y. Kambayashi, "Routing Problems on the Mesh of Buses," Proc. ISAAC '92 (Lecture Notes in Computer Science 650). Springer-Verlag, 1992.
[9] D.W. Krumme, G. Cybenko, and K.N. Venkataraman, “Gossiping in Minimal Time,” SIAM J. Computing, vol. 21, no. 1, pp. 111-139, Feb. 1992.
[10] V.K. Prasanna Kumar and C.S. Raghavendra, "Array Processor with Multiple Broadcasting," Proc. 12th Int'l Symp. Computer Architecture, pp. 2-10, 1985.
[11] K. Nakano, T. Masuzawa, and N. Tokura, "Optimal Sorting Algorithms on Processor Arrays with Multiple Buses," Technical Report COMP, IEICE Japan, 91-7, 1991.
[12] Q.F. Stout, "Meshes with Multiple Buses," Proc. 27th FOCS, pp. 264-273, 1986.

Index Terms:
Routing algorithm, mesh computer, shared bus, gossiping, packet length, optimal time bound.
Satoshi Fujita, Masafumi Yamashita, "Fast Gossiping on Mesh-Bus Computers," IEEE Transactions on Computers, vol. 45, no. 11, pp. 1326-1330, Nov. 1996, doi:10.1109/12.544491
Usage of this product signifies your acceptance of the Terms of Use.