The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—All-to-all personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. It is one of the most dense communication patterns. In this paper, we consider this problem in a torus of any dimension with the wormhole-routing capability. We propose complete exchange algorithms that use optimal numbers of phases (if each side of the tori is a multiple of eight) or asymptotically optimal numbers of phases (otherwise). Interestingly, in order to achieve this, we only make weak assumptions—that a node is capable of sending and receiving at most one message at a time, and the network is capable of supporting the dimension-ordered (or e-cube) minimum routing.</p>
All-to-all personalized communication, complete exchange, collective communication, multicomputer network, parallel computing, torus, wormhole routing.
Sandeep K.S. Gupta, Yu-Chee Tseng, "All-to-All Personalized Communication in a Wormhole-Routed Torus", IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 498-505, May 1996, doi:10.1109/71.503775
194 ms
(Ver 3.3 (11022016))