Optimal gossip in store-and-forward noncombining 2-D tori

  • Michal Šoch
  • Pavel Tvrdík
Workshop 02: Routing and Communication in Networks
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1300)


The main result of this paper is an algorithm for optimal gossip (all-to-all broadcast) in 2-D tori in the store-and-forward noncombining full-duplex all-port communication model. The algorithm is based on a construction of minimum-height time-arc-disjoint broadcast trees of arbitrary 2-D tori.


interconnection networks gossip all-to-all broadcast time-arc-disjoint broadcast trees store-and-forward 2-D torus 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation. Prentice Hall, 1989.Google Scholar
  2. 2.
    B. Plateau and D. Trystam. Optimal total exchange for a 3-D torus of processors. Information Processing Letters, 42:95–102, 1992. *** DIRECT SUPPORT *** A0008C42 00008Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Michal Šoch
    • 1
  • Pavel Tvrdík
    • 1
  1. 1.Department of Computer Science and EngineeringCzech Technical UniversityPragueCzech Republic

Personalised recommendations