Scheduling divisible tasks on heterogeneous linear arrays with applications to layered networks
Keqin Li · 2002
We propose a method for analyzing the parallel time and speedup of processing divisible tasks on a layered static network by transforming the network into an equivalent heterogeneous linear array network. We derive a recurrence relation so that the parallel processing time and speedup can be easily calculated for any layered network, including linear arrays, rings, complete trees, pyramids, and hypercubes.