Scheduling divisible tasks on heterogeneous linear arrays with applications to layered networks

Keqin Li Keqin Li

doi:10.1109/ipdps.2002.1016659

Scheduling divisible tasks on heterogeneous linear arrays with applications to layered networks

Keqin Li Keqin Li

https://doi.org/10.1109/ipdps.2002.1016659

Copy DOI

Publication Date: Jan 1, 2002

Citations: 19

Affiliation: State University of New York at New Paltz

#Parallel Processing Time #Divisible Tasks + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

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.

Full Text