Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
On the number of rounds necessary to disseminate information
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
SIAM Journal on Computing
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Optimal Group Gossiping in Hypercubes Under A Circuit-Switching Model
SIAM Journal on Computing
Efficient multiple multicasting in hypercubes
Journal of Systems Architecture: the EUROMICRO Journal
Approximation algorithms for broadcasting and gossiping
Journal of Parallel and Distributed Computing
Communication complexity of gossiping by packets
Journal of Parallel and Distributed Computing
Fast Gossiping by Short Messages
SIAM Journal on Computing
Complexity and approximations for multimessage multicasting
Journal of Parallel and Distributed Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Message Multicasting in Heterogeneous Networks
SIAM Journal on Computing
Bounded fan-out multimessage multicasting
Nordic Journal of Computing
Gossiping in the Multicasting Communication Environment
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Randomized Broadcast in Networks
SIGAL '90 Proceedings of the International Symposium on Algorithms
The algorithm of pipelined gossiping
Journal of Systems Architecture: the EUROMICRO Journal
Hi-index | 0.00 |
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.