hide
Free keywords:
-
Abstract:
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.
