Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Gossiping Large Packets on Full-Port Tori


Meyer,  Ulrich
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Sibeyn,  Jop F.
Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Meyer, U., & Sibeyn, J. F. (1998). Gossiping Large Packets on Full-Port Tori. In D. Pritchard, & J. Reeve (Eds.), Proceedings of the 4th International Euro-Par Conference (Euro-Par-98) (pp. 1040-1046). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3797-E
Near-optimal gossiping algorithms are given for two- and higher dimensional tori. It is assumed that the amount of data each PU is contributing is so large, that start-up time may be neglected. For two-dimensional tori, an earlier algorithm achieved optimality in an intricate way, with a time-dependent routing pattern. In our algorithms, in all steps, the PUs forward the received packets in the same way.