| Abstract |
|---|
| 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. |
| Contact |
| Ulrich Meyer Max-Planck-Institut fuer Informatik,Im Stadtwald,66123 Saarbruecken,Germany umeyer@mpi-sb.mpg.de |