ABSTRACT

<p><b>Abstract</b>—We give the closed form solutions to the parallel time and speedup of the classic method for processing divisible loads on linear arrays as functions of <tmath>N</tmath>, the network size. We propose two methods which employ pipelined communications to distribute divisible loads on linear arrays. We derive the closed form solutions to the parallel time and speedup for both methods and show that the asymptotic speedup of both methods is <tmath>\beta+1</tmath>, where <tmath>\beta</tmath> is the ratio of the time for computing a unit load to the time for communicating a unit load. Such performance is even better than that of the known methods on <tmath>k{\hbox{-}}{\rm{dimensional}}</tmath> meshes with <tmath>k>1</tmath>. The two new algorithms which use pipelined communications are generalized to distribute divisible loads on <tmath>k{\hbox{-}}{\rm{dimensional}}</tmath> meshes, and we show that the asymptotic speedup of both algorithms is <tmath>k\beta+1</tmath>, where <tmath>k\ge1</tmath>. We also prove that, on <tmath>k{\hbox{-}}{\rm{dimensional}}</tmath> meshes where <tmath>k\ge1</tmath>, as the network size becomes large, the asymptotic speedup of <tmath>2k\beta+1</tmath> can be achieved for processing divisible loads by using interior initial processors.</p>

INDEX TERMS

Divisible load, linear array, load distribution, performance analysis, pipelined communication, speedup.

CITATION

Keqin Li, "Improved Methods for Divisible Load Distribution on k-Dimensional Meshes Using Pipelined Communications",

*IEEE Transactions on Parallel & Distributed Systems*, vol. 14, no. , pp. 1250-1261, December 2003, doi:10.1109/TPDS.2003.1255637CITATIONS

SEARCH