Skip to Main Content
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 N, 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 β+1, where β is the ratio of the time for computing a unit toad to the time for communicating a unit load. Such performance is even better than that of the known methods on k-dimensional meshes with k>1. The two new algorithms which use pipelined communications are generalized to distribute divisible loads on k-dimensional meshes, and we show that the asymptotic speedup of both algorithms is kβ+1, where k≥1. We also prove that, on k-dimensional meshes where k≥1, as the network size becomes large, the asymptotic speedup of 2kβ+1 can be achieved for processing divisible loads by using interior initial processors.