Faster Gossiping on Butterflies

Authors:
Jop F. Sibeyn
Affiliations:
-
Venue:
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Year:
2001

Citing 6
Cited 0

Broadcasting and Gossiping in de Bruijn Networks

SIAM Journal on Computing
Quick gossiping by telegraphs

Discrete Mathematics
Approximation algorithms for broadcasting and gossiping

Journal of Parallel and Distributed Computing
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
Heuristic Algorithms for Broadcasting in Point-to-Point Computer Networks

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Gossiping has been considered intensively for butterflies and "regular" 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 2/1 ċ k and 3 ċ k communication rounds, respectively. By new asymptotic methods we break through these bounds, proving new bounds of 2 4/1 ċ k + o(k) and 2 2/1 ċ k + o(k).