The Community for Technology Leaders
Green Image
In the divisible load distribution, the classic methods on linear arrays divide the computation and communication processes into multiple time intervals in a pipelined fashion. Li (2003) has proposed a set of improved algorithms for linear arrays which can be generalized to k-dimensional meshes. In this paper, we first propose the algorithm M (multi-installment) that employs the multi-installment technique to improve the best algorithm Q proposed by Li. Second, we propose the algorithm S (start-up cost) that includes the computation and communication start-up costs in the design. While the asymptotic speedups of our algorithms M and S derived from the closed-form solutions are the same as algorithm Q, our algorithms approach the optimal speedups considerably faster than algorithm Q as the number of processors increases. Finally, we combine algorithms M and S and propose the algorithm MS. While algorithm MS has the same the asymptotic performance as algorithms Q and S, it achieves a better speedup when the load to be processed is very large and the number of processors is fixed or when the load to be processed is fixed and the number of processors is small.
Divisible load theory, linear array, k-dimensional mesh, multi-installment

C. Chen, C. Chu, Y. Chang and J. Wu, "Improved Methods for Divisible Load Distribution on k-Dimensional Meshes Using Multi-Installment," in IEEE Transactions on Parallel & Distributed Systems, vol. 18, no. , pp. 1618-1629, 2007.
91 ms
(Ver 3.3 (11022016))