Optimal gossip in store-and-forward noncombining 2-D tori
The main result of this paper is an algorithm for optimal gossip (all-to-all broadcast) in 2-D tori in the store-and-forward noncombining full-duplex all-port communication model. The algorithm is based on a construction of minimum-height time-arc-disjoint broadcast trees of arbitrary 2-D tori.
Keywordsinterconnection networks gossip all-to-all broadcast time-arc-disjoint broadcast trees store-and-forward 2-D torus
Unable to display preview. Download preview PDF.