Gossiping in vertex-disjoint paths mode in interconnection networks

Extended abstract
  • Juraj Hromkovič
  • Ralf Klasing
  • Elena A. Stöhr
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 790)


The communication modes (one-way and two-way mode) used for disseminating information among processors of interconnection networks via vertex-disjoint paths in one communication step are investigated. The complexity of communication algorithms is measured by the number of communication steps (rounds). Since optimal broadcast and accumulation algorithms for these modes can be achieved in a straightforward way for almost all interconnection networks used, the paper concentrates on the gossip problem. The main results are listed below:
  1. 1.

    Optimal gossip algorithms for paths, complete graphs and flakes in both modes.

  2. 2.

    For hypercubes, cube-connected cycles, butterfly networks, etc., gossip algorithms which are only about O(log2 log2n) rounds slower than the optimal gossip algorithms on complete graphs are designed. Furthermore, it is shown that at least Ω(log2 log2 log2n) rounds more than needed by the optimal gossip algorithm on the complete graph are necessary for every “well-structured” gossip algorithm on networks with “small” degree.


Note that the results achieved have also practical application, because the vertex-disjoint paths mode can be implemented in several hardware realisations of computing networks.


Complete Graph Interconnection Network Hamiltonian Path Communication Step Permutation Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [EM89]
    S. Even, B. Monien, “On the number of rounds necessary to disseminate information”, Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, Santa Fe, June 1989, pp. 318–327.Google Scholar
  2. [ES79]
    R.C. Entringer, P.J. Slater, “Gossips and telegraphs”, J. Franklin Institute 307 (1979), pp. 353–360.Google Scholar
  3. [Fa80]
    A.M. Farley, “Minimum-Time Line Broadcast Networks”, Networks, Vol. 10 (1980), pp. 59–70.Google Scholar
  4. [FHMMM92]
    R. Feldmann, J. Hromkovič, S. Madhavapeddy, B. Monien, P. Mysliwietz, “Optimal algorithms for dissemination of information in generalized communication modes”, Proc. PARLE'92, Lecture Notes in Computer Science 605, Springer Verlag 1992, pp. 115–130.Google Scholar
  5. [FL91]
    P. Fraigniaud, E. Lazard, ”Methods and problems of communication in usual networks”, Technical Report, Université de ParisSud, 1991, submitted to Discrete Applied Mathematics, special issue on ” Broadcasting and Gossiping”.Google Scholar
  6. [FM92]
    R. Feldmann, P. Mysliwietz, ”The Shuffle Exchange Network has a Hamiltonian Path”, Proc. of 17th Math. Foundations of Computer Science (MFCS'92), Springer LNCS 629, pp. 246–254.Google Scholar
  7. [FU92]
    R. Feldmann, W. Unger, ”The Cube-Connected Cycles Network is a Subgraph of the Butterfly Network”, Parallel Processing Letters, Vol. 2, No. 1 (1992), pp. 13–19.Google Scholar
  8. [HHL88]
    S.M. Hedetniemi, S.T. Hedetniemi, A.L. Liestman, ”A survey of gossiping and broadcasting in communication networks”, Networks, Vol. 18, pp. 319–349, 1988.Google Scholar
  9. [HJM90]
    J. Hromkovič, C. D. Jeschke, B. Monien, ”Optimal algorithms for dissemination of information in some interconnection networks (extended abstract)”, Proc. MFCS'90, Lecture Notes in Computer Science 452, Springer Verlag 1990, pp. 337–346.Google Scholar
  10. [HKMP92]
    J. Hromkovič, R. Klasing, B. Monien, R. Peine, ”Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping)”, manuscript, University of Paderborn, Germany, Feb. 1993, to appear as a book chapter in: F. Hsu, D.-Z. Du (Eds.), Combinatorial Network Theory, Science Press & AMS, 1994.Google Scholar
  11. [HS74]
    F. Harary, A.J. Schwenk, ”The communication problem on graphs and digraphs”, J, Franklin Institute 297 (1974), pp. 491–495.Google Scholar
  12. [KCV92]
    D.W. Krumme, G. Cybenko, K.N. Venkataraman, ”Gossiping in minimal time”, SIAM J. Comput. 21 (1992), pp. 111–139.Google Scholar
  13. [KMPS92]
    R. Klasing, B. Monien, R. Peine, E. Stohr, ”Broadcasting in Butterfly and DeBruijn networks”, Proc. STACS'92, Lecture Notes in Computer Science 577, Springer Verlag 1992, pp. 351–362.Google Scholar
  14. [Kn75]
    W. Knödel, ”New gossips and telephones”, Discrete Math. 13 (1975), p. 95.Google Scholar
  15. [Le91]
    F.T. Leighton, “Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes”, Morgan Kaufmann Publishers (1991).Google Scholar
  16. [LW90]
    R. Labahn, I. Warnke, ”Quick gossiping by multi-telegraphs”, In R. Bodendiek, R. Henn (Eds.), Topics in Combinatorics and Graph Theory, pp. 451–458, Physica-Verlag Heidelberg, 1990.Google Scholar
  17. [MS90]
    B. Monien, I.H. Sudborough, ”Embedding one Interconnection Network in Another”, Computing Suppl. 7, pp. 257–282, 1990.Google Scholar
  18. [SW93]
    V.S. Sunderam, P. Winkler, ”Fast information sharing in a complete network”, Discrete Applied Mathematics 42 (1993), pp. 75–86.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Juraj Hromkovič
    • 1
  • Ralf Klasing
    • 1
  • Elena A. Stöhr
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of PaderbornPaderbornGermany

Personalised recommendations