Advertisement

Time-Optimal gossip in noncombining 2-D tori with constant buffers

  • Michal šoch
  • Pavel Tvrdík
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1470)

Abstract

This paper describes a time-, transmission-, and memory-optimal algorithm for gossiping in general 2-D tori in the noncombining full-duplex and all-port communication model.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J.-C. Bermond, T. Kodate, and S. Perennes. Gossiping in Cayley graphs by packets. In M. Deza, et. al., editors, Combinatorics and Computer Science, LNCS 1120, pages 301–315. Springer, 1995.Google Scholar
  2. 2.
    M. šoch and P. Tvrdík. Optimal gossip in store-and-forward noncombining 2-D tori. In C. Lengauer, et. al., editors, Euro-Par’97 Parallel Processing, LNCS 1300, pages 234–241. Springer, 1997. Research report at http://cs.felk.cvut.cz/pcg/.Google Scholar
  3. 3.
    M. šoch and P. Tvrdík. Time-optimal gossip in noncombining 2-D tori with constant buffers. Manuscript at http://cs.felk.cvut.cz/pcg/.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

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

Personalised recommendations