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 1/2 • k and 3 • k communication rounds, respectively. By new asymptotic methods we break through these bounds, proving new bounds of 2 1/4 • k + o(k) and 2 1/2 • k + o(k).
Most of the work on this paper has been performed during an appointment at and a visit to the Max-Planck-Institut für Informatik in Saarbrücken, Germany.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bermond, J.-C., P. Fraigniaud, ‘Broadcasting and Gossiping in de Bruijn Networks,’ SIAM Journal on Computing, 23(1), pp. 212–225, 1994.
Delmas, O., S. Perennes, ‘Circuit-Switched Gossiping in 3-Dimensional Torus Networks,’ Proc. 2nd Euro-Par Conference, LNCS 1123, pp. 370–373, Springer-Verlag, 1996.
Fertin, G., ‘Trade-Offs for Odd Gossiping,’ Proc. 6th Colloquium on Structural Information ℰ Communication Complexity, Proceedings in Informatics 5, pp. 137–151, Carleton Scientific, 1999.
Fraigniaud, P., J.G. Peters, ‘Minimum Linear Gossip Graphs and Maximal Linear (Δ k)-Gossip Graphs,’ Techn. Rep. CMPT TR 94-06, Simon Fraser University, Burnaby, B.C., 1994. Available at http://www.fas.sfu.ca/pub/cs/techreports/1994/.
Fraigniaud, P., S. Vial, ‘Approximation Algorithms for Broadcasting and Gossiping,’ Journal of Parallel and Distributed Computing, 43(1), pp. 47–55, 1997.
Fraigniaud, P., S. Vial, ‘Comparison of Heuristics for One-to-All and All-to-All Communication in Partial Meshes,’ Parallel Processing Letters, 9(1), pp. 9–20, 1999.
Gvozdjak, P., J.G. Peters, ‘Gossiping in Inclined LEO Satellite Networks,’ Proc. 6th Colloquium on Structural Information and Communication Complexity, Proceedings in Informatics 5, pp. 166–180, Carleton Scientific, 1999.
Hromkovič, J., R. Klasing, B. Monien, R. Peine, ‘Dissemination of Information in Interconnection Networks,’ Combinatorial Network Theory, D.-Z. Du, D.F. Hsu (eds.), pp. 125–212, Kluwer Academic Publishers, 1996.
M. Kaufmann, R. Raman, J.F. Sibeyn, ‘Randomized Routing on Meshes with Buses,’ Algorithmica, 18, pp. 417–444, 1997.
Labahn, R., I. Warnke, ‘Quick Gossiping by Telegraphs,’ Discrete Mathematics, 126, pp. 421–424, North-Holland, 1994.
Beier, R., J.F. Sibeyn, ‘A Powerful Heuristic for Telephone Gossiping,’ Proc. 7th Colloquium on Structural Information and Communication Complexity, pp. 17–35, Proceedings in Informatics 7, Carleton Scientific, 2000.
Scheuermann, P., G. Wu, ‘Heuristic Algorithms for Broadcasting in Point-to-Point Computer Networks,’ IEEE Transactions on Computers, C-33(9), 1984.
Šoch, M., P. Tvrdík, ‘Optimal Gossip in Store-and-Forward Noncombining 2-D Tori,’ Proc. 3rd International Euro-Par Conference, LNCS 1300, pp. 234–241, Springer-Verlag, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sibeyn, J.F. (2001). Faster Gossiping on Butterflies. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_64
Download citation
DOI: https://doi.org/10.1007/3-540-48224-5_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42287-7
Online ISBN: 978-3-540-48224-6
eBook Packages: Springer Book Archive