The complexity of systolic dissemination of information in interconnection networks

Extended abstract
  • Juraj Hromkovič
  • Ralf Klasing
  • Walter Unger
  • Hubert Wagener
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 805)


A concept of systolic dissemination of information in interconnection networks is introduced, and the complexity of systolic gossip in one-way (telegraph) and two-way (telephone) communication mode is investigated. Optimal systolic algorithms in both communication modes are constructed for paths and complete k-ary trees for any k≥2.


communication algorithms parallel computations 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BHMS90]
    A. Bagchi, S. L. Hakimi, J. Mitchem, E. Schmeichel: Parallel algorithms for gossiping by mail. Information Process. Letters 34 (1990), 197–202.Google Scholar
  2. [CC84]
    C. Choffrut, K. Culik II: On real-time cellular automata and trellis automata. Acta Informatica 21 (1984), 393–407.Google Scholar
  3. [CGS83]
    K. Culik II, J. Gruska, A. Salomaa: Systolic automata for VLSI on balanced trees. Acta Informatica 18 (1983), 335–344.Google Scholar
  4. [CGS84]
    K. Culik II, I. Gruska, A. Salomaa: Systolic trellis automata. Part I. Intern. J. Comput. Math. 15 (1984), 195–212.Google Scholar
  5. [CSW84]
    K. Culik II, A. Salomaa, D. Wood: Systolic tree acceptors. R.A.I.R.O. Theoretical Informatics 18 (1984), 53–69.Google Scholar
  6. [HHL88]
    S. M. Hedetniemi, S. T. Hedetniemi, A. L. Liestmann: A survey of gossiping and broadcasting in communication networks. Networks 18 (1988), 319–349.Google Scholar
  7. [HJM93]
    J. Hromkovič, C.-D. Jeschke, B. Monien: Note an optimal gossiping in some weak-connected graphs. Theoretical Computer Science, to appear.Google Scholar
  8. [HKMP93]
    J. Hromkovič, R. Klasing, B. Monien, R. Peine: Dissemination of information in interconnection networks (broadcasting & gossiping). In: Combinatorial Network Theory (Frank Hsu, Ding-Zhu Du, Eds.), Science Press, AMS 1993, to appear.Google Scholar
  9. [IK84]
    O. H. Ibarra, S. M. Kim: Characterizations and computational complexity of systolic trellis automata. Theoretical Computer Science 29 (1984), 123–153.Google Scholar
  10. [IKM85]
    O. H. Ibarra, S. M. Kim, S. Moran: Sequential machine characterizations of trellis and cellular automata and applications. SIAM J. Comput. 14 (1985), 426–447.Google Scholar
  11. [IPK85]
    O. H. Ibarra, M. A. Palis, S. M. Kim: Fast parallel language recognition by cellular automata. Theoretical Computer Science 41 (1985), 231–246.Google Scholar
  12. [Ku79]
    H.T. Kung: Let's design algorithms for VLSI systems. In: Proc. of the Caltech Conference of VLSI (CL.L. Seifz Ed.), Pasadena, California 1979, pp. 65–90.Google Scholar
  13. [LHL93]
    R. Labahn, S.T. Hedetniemi, R. Laskar, Periodic gossiping on trees. to appear in: Discrete Applied Mathematics.Google Scholar
  14. [LR93a]
    A.L. Liestman, D. Richards: Network communication in edge-colored graphs: Gossiping. IEEE Trans. Par. Distr. Syst. 4 (1993), 438–445.Google Scholar
  15. [LR93b]
    A.L. Liestman, D. Richards: Perpetual gossiping. Technical Report, Simon Fraser University, Vancouver, Canada, 1993.Google Scholar
  16. [MS90]
    B. Monien, I. H. Sudborough: Embedding one interconnection network in another. Computing Suppl. 7 (1990), 257–282.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Juraj Hromkovič
    • 1
  • Ralf Klasing
    • 1
  • Walter Unger
    • 1
  • Hubert Wagener
    • 2
  1. 1.Department of Mathematics and Computer ScienceUniversity of PaderbornPaderbornGermany
  2. 2.Faculty of Mathematics and PhysicsComenius UniversityBratislavaSlovakia

Personalised recommendations