Distributed computation with communication delays: asymptotic performance analysis
Journal of Parallel and Distributed Computing
Scheduling divisible jobs on hypercubes
Parallel Computing
Distributed processing of divisible jobs with communication startup costs
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Divisible task scheduling — concept and verification
Parallel Computing - Special issue on task scheduling problems for parallel and distributed systems
Scheduling divisible loads in a three-dimensional mesh of processors
Parallel Computing
Scheduling a divisible task in a two-dimensional toroidal mesh
Proceedings of the third international conference on Graphs and optimization
Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job
IEEE Transactions on Computers
Optimizing Computing Costs Using Divisible Load Analysis
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Scheduling data intensive parallel processing in distributed and networked environments
Scheduling data intensive parallel processing in distributed and networked environments
Validity of the single processor approach to achieving large scale computing capabilities
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
| Hi-index | 0.00 |
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.