Parallel Information Dissemination by Packets
- 1 April 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 23 (2) , 355-372
- https://doi.org/10.1137/s0097539790192672
Abstract
Each vertex of an undirected graph possesses a piece of information that must be sent to every other vertex. They communicate by sending bounded size packets of messages from one vertex to another. The authors describe parallel algorithms, which accomplish the desired tasks for six prominent architectures. The algorithms are optimal, or nearly so, in every case.Keywords
This publication has 11 references indexed in Scilit:
- Sequential information dissemination by packetsNetworks, 1992
- Fast Gossiping for the HypercubeSIAM Journal on Computing, 1992
- Gossiping in Minimal TimeSIAM Journal on Computing, 1992
- Parallel algorithms for gossiping by mailInformation Processing Letters, 1990
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- A Problem with TelephonesSIAM Journal on Algebraic Discrete Methods, 1981
- Further gossip problemsDiscrete Mathematics, 1980
- Gossips and telegraphsJournal of the Franklin Institute, 1979
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- The communication problem on graphs and digraphsJournal of the Franklin Institute, 1974