MPI-I-98-1-014. June 1998, 20 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
Near-optimal gossiping algorithms are given for two- and higher
dimensional tori. It is assumed that the amount of data each PU
contributes is so large that start-up time may be neglected.
For two-dimensional tori, a previous algorithm achieved optimality
in an intricate way, with a time-dependent routing pattern.
In all steps of our algorithms, the PUs forward the received
packets in the same way.
References to related material:
|To download this research report, please select the type of document that fits best your needs.||Attachement Size(s):|
|Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView|