Toward optimal complete exchange on wormhole-routed tori

Yu-Chee Tseng*, Sze Yao Ni, Jang Ping Sheu

*Corresponding author for this work

研究成果: Paper同行評審

4 引文 斯高帕斯(Scopus)

摘要

In this paper, we propose new routing schemes to perform all-to-all personalized communication (or known as complete exchange) in wormhole-routed, one-port tori. In the literature, some algorithms are optimal in only one of startup and transmission costs, while some, although are asymptotically optimal in both costs, will incur much larger constants associated with the costs. Our algorithms use both asymptotically optimal startup and transmission time on tori of equal size along each dimension. The schemes are characterized by: (i) the use of gather-scatter tree to achieve optimality in startup time, (ii) the enforcement of shortest paths in routing messages to achieve optimality in transmission time, (iii) the application of network-partitioning techniques to reduce the constant associated with the transmission time, and (iv) the dimension-by-dimension and gather-scatter-tree approach to make possible applying the schemes to non-square, any-size tori. Numerical analysis and experiment both show significant improvement on total communication latency over existing results.

原文English
頁面96-103
頁數8
出版狀態Published - 1 十二月 1997
事件Proceedings of the 1997 International Conference on Parallel and Distributed Systems - Seoul, South Korea
持續時間: 10 十二月 199713 十二月 1997

Conference

ConferenceProceedings of the 1997 International Conference on Parallel and Distributed Systems
城市Seoul, South Korea
期間10/12/9713/12/97

指紋 深入研究「Toward optimal complete exchange on wormhole-routed tori」主題。共同形成了獨特的指紋。

引用此