Broadcasting and Gossiping in de Bruijn Networks
SIAM Journal on Computing
Discrete Mathematics
Approximation algorithms for broadcasting and gossiping
Journal of Parallel and Distributed Computing
Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Lower Bounds on Systolic Gossip
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Optimal Gossip in Store-and-Forward Noncombining 2-D Tori
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Circuit-Switched Gossiping in 3-Dimensional Torus Networks
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
A generic theoretical framework for modeling gossip-based algorithms
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
| Hi-index | 0.00 |
Gossiping has been considered intensively for butterflies and "simple" butterflies (which have no wrap-around connections). In the "telephone" communication model, for a butterfly of order k, the best previous gossiping algorithms require 2½k and 3k communication rounds, respectively. By new asymptotic methods we break through these bounds. We show that gossiping on a class of "column-based" networks, which also contains the cube-connected cycles, can be reduced to the simpler problem of "row-gossiping". Row-gossiping in turn is reduced to "coherent row-broadcasting". This latter problem is sufficiently simple to be solved by a sophisticated computer program for butterflies with up to 15 × 215 nodes. Out of the produced solutions a pattern is distilled, which can be used to perform gossiping on butterflies and simple butterflies of order k in 21/4k + o(k) and 2½k + o(k) rounds, respectively, for any k, considerably reducing the gap with the lower bounds. The new upper bounds also hold for gossiping in the weaker "telegraph" model.