Issue No. 12 - December (1999 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.819947
<p><b>Abstract</b>—The main results of this paper are algorithms for time-optimal gossip of large packets in noncombining full-duplex all-port 2-D tori and meshes of any size <tmath>$m\times n$</tmath>. The gossip algorithms define the structure of broadcast trees and lock-step scheduling schemes for packets that make the broadcast trees time-arc-disjoint. The gossip algorithm for tori is also buffer-optimal—it requires routers with auxiliary buffers for at most three packets. The gossip algorithm for meshes requires routers with auxiliary buffers for <tmath>$O(m+n)$</tmath> packets.</p>
All-to-all broadcast, gossip, 2D torus, 2D mesh, time-arc-disjoint broadcast trees, buffer requirements.
Michal Soch, Pavel Tvrdík, "Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and Meshes", IEEE Transactions on Parallel & Distributed Systems, vol. 10, no. , pp. 1252-1261, December 1999, doi:10.1109/71.819947