Improved Bounds for Gossiping in Mesh Bus Networks

Improved bounds for the minimum gossiping time in mesh bus networks of arbitrary dimension for 1-port model are given. More precisely, the gossiping protocol consists of steps during which messages are sent via buses and at the end of the protocol, all the nodes should know all the information. Furthermore, during one step a bus can carry at most one message, and each node can either send or receive (not both) on at most one bus The minimum gossiping time of a bus network G is the minimum number of steps required to perform a gossip under this model. Here we determine almost exactly the minimum gossip time for 2-dimensional mesh bus networks and give tight bounds for d-dimensional mesh bus networks.

[1]  A Louri,et al.  Optical binary de Bruijn networks for massively parallel computing: design methodology and feasibility study. , 1995, Applied optics.

[2]  Dominique Sotteau,et al.  Communications in Bus Networks , 1994, Canada-France Conference on Parallel and Distributed Computing.

[3]  Joe Kilian,et al.  The organization of permutation architectures with bussed interconnections , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[4]  Kazuo Iwama,et al.  Routing Problems on the Mesh of Buses , 1992, ISAAC.

[5]  Satoshi Fujita,et al.  Optimal Gossiping in Mesh-Bus Computers , 1993, Parallel Process. Lett..

[6]  Pascal Berthomé,et al.  Models for Optically Interconnected Networks , 1998 .

[7]  Ted H. Szymanski,et al.  "Hypermeshes": Optical Intercomnnection Network for Parallel Computing , 1995, J. Parallel Distributed Comput..

[8]  Jean-Claude Bermond,et al.  Bus Interconnection Networks , 1996, Discret. Appl. Math..

[9]  Thomas E. Stern,et al.  Design of multicast multilayered lightwave networks , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[10]  Arun K. Jagota.  A near-optimal algorithm for gossiping in a d-dimensional mesh bus interconnection network , 1995, Proceedings of 9th International Parallel Processing Symposium.

[11]  Dominique Sotteau,et al.  Gossiping in d-Dimensional Mesh-Bus Networks , 1996, Parallel Process. Lett..