The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—We address the problem of mapping divide-and-conquer programs to mesh connected multicomputers with wormhole or store-and-forward routing. We propose the <it>binomial tree</it> as an efficient model of parallel divide-and-conquer and present two mappings of the binomial tree to the 2D mesh. Our mappings exploit regularity in the communication structure of the divide-and-conquer computation and are also sensitive to the underlying flow control scheme of the target architecture. We evaluate these mappings using new metrics which are extensions of the classical notions of dilation and contention. We introduce the notion of <it>communication slowdown</it> as a measure of the total communication overhead incurred by a parallel computation. We conclude that significant performance gains can be realized when the mapping is sensitive to the flow control scheme of the target architecture.</p>
Mapping, embedding, divide-and-conquer algorithms, binomial tree, mesh connected machines, routing, wormhole routing, store-and-forward routing, contention, dilation.

V. Lo, X. Zhong, S. Rajopadhye and J. A. Telle, "Parallel Divide and Conquer on Meshes," in IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 1049-1058, 1996.
92 ms
(Ver 3.3 (11022016))