Issue No. 10 - October (1999 vol. 48)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.805156
<p><b>Abstract</b>—In this paper, we propose new routing schemes to perform <it>all-to-all personalized communication</it> (or known as <it>complete exchange</it>) in wormhole-routed, one-port tori. On tori of equal size along each dimension, our algorithms use both asymptotically optimal startup and transmission time. The results are characterized by several interesting features: 1) the use of <it>gather-scatter</it> tree to achieve optimality in startup time, 2) enforcement of shortest paths in routing messages to achieve optimality in transmission time, 3) application of <it>network-partitioning</it> techniques to reduce the constant associated with the transmission time, and 4) the dimension-by-dimension and gather-scatter-tree approach to make possible applying the results to nonsquare, any-size tori. In the literature, some algorithms are optimal in only one of startup and transmission costs, while some, although asymptotically optimal in both costs, will incur much larger constants associated with the costs. Numerical analysis and experiment both show that significant improvement can be obtained by our scheme on total communication latency over existing results.</p>
All-to-all personalized communication, broadcast, complete exchange, gossiping, multicomputer network, torus, wormhole routing.
S. Ni, Y. Tseng and J. Sheu, "Toward Optimal Complete Exchange on Wormhole-Routed Tori," in IEEE Transactions on Computers, vol. 48, no. , pp. 1065-1082, 1999.