The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—The interprocessor complete exchange communication pattern can be found in many important parallel algorithms. In this paper, we present algorithms for complete exchange on 2D mesh-connected multiprocessors. The unique feature of the proposed algorithms is that they are configurable where the time for message startups can be traded against larger message sizes. At one extreme, the algorithm minimizes the number of message startups at the expense of an increased amount of time spent in message transmission. At the other extreme, the time spent in message transmission is reduced at the expense of an increased number of message startups. The structure of the algorithms is such that intermediate solutions are feasible, i.e., the number of message startups can be increased slightly and the message transmission time is correspondingly reduced. The ability to configure these algorithms enables the algorithm characteristics to be matched with machine characteristics based on specific overheads for message initiation and link speeds to minimize overall execution time. In effect, the algorithms can be configured to strike the right balance between direct and message combining approaches on a specific architecture for a given problem size. We believe these algorithms are distinguished by this ability and contribute to efficient portable implementations of complete exchange algorithms.</p>
Interprocessor communication, parallel algorithms, collective communication, all-to-all communication, all-to-all personalized exchange, complete exchange.

Y. Suh and S. Yalamanchili, "Configurable Algorithms for Complete Exchange in 2D Meshes," in IEEE Transactions on Parallel & Distributed Systems, vol. 11, no. , pp. 337-356, 2000.
87 ms
(Ver 3.3 (11022016))