Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

An efficient algorithm for gossiping in the multicasting communication environment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Gonzalez, T.F. ; Dept. of Comput. Sci., Univ. of California, Santa Barbara, CA, USA

We present an algorithm for the gossiping problem defined over an n processor communication network, N, where message multicasting is allowed. The algorithm generates a communication schedule with a total communication time at most N+r, where r is the radius of the network. Our algorithm begins by constructing a spanning tree (or tree network T) with the least possible radius. Then, all the communications are carried out in the tree network as follows: each processor waits its turn to transmit "almost" consecutively to its parent and children all the messages in its subtree. During other times, each processor transmits to its children all the messages emanating elsewhere in the network.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:14 ,  Issue: 7 )