Issue No. 08 - August (1997 vol. 8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.605769
<p><b>Abstract</b>—Data distribution has been one of the most important research topics in parallelizing compilers for distributed memory parallel computers. Good data distribution schema should consider both the computation load balance and the communication overhead. In this paper, we show that data redistribution is necessary for executing a sequence of Do-loops if the communication cost due to performing this sequence of Do-loops is larger than a threshold value. Based on this observation, we can prune the searching space and derive efficient dynamic programming algorithms for determining effective data distribution schema to execute a sequence of Do-loops with a general structure. Experimental studies on a 32-node nCUBE-2 computer are also presented.</p>
Component alignment, data distribution, distributed memory computer, Do-loops, dynamic programming algorithm for data distribution, parallelizing compiler.
P. Lee, "Efficient Algorithms for Data Distribution on Distributed Memory Parallel Computers," in IEEE Transactions on Parallel & Distributed Systems, vol. 8, no. , pp. 825-839, 1997.