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
Scheduling Divisible Tasks on Heterogeneous Linear Arrays with Applications to Layered Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
IEEE Transactions on Parallel and Distributed Systems
Multiround Algorithms for Scheduling Divisible Loads
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
A new load distribution strategy for linear network with communication delays
Mathematics and Computers in Simulation
An equivalent network for divisible load scheduling in nonblocking mode of communication
Computers & Mathematics with Applications
Scalability limits of Bag-of-Tasks applications running on hierarchical platforms
Journal of Parallel and Distributed Computing
Computing BLAS level-2 operations on workstation clusters using the divisible load paradigm
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
We analyze the parallel time and speedup for processing a divisible load on (1) a linear array with a corner initial processor; (2) a linear array with an interior initial processor; (3) a mesh with a corner initial processor; (4) a mesh with an interior initial processor; (5) a b-ary complete tree with the root as the initial processor; (6) a pyramid with the apex as the initial processor. Due to communication overhead and limited network connectivity, the speedup of parallel processing for a divisible load on static interconnection networks with constant node degrees is bounded from above by a quantity independent of network size. It is shown that for the above six cases, as the network size becomes large, the asymptotic speedup is approximately $\sqrt{\beta}$, 2$\sqrt{\beta}$, β3/4, 4β3/4, (b−1)β, and 3β, respectively, where β is the ratio of the time for computing a unit load to the time for communicating a unit load. We also investigate divisible load distribution on hypercubes. Our strategy takes advantage of the recursive structure of a hypercube. It is proven that linear speedup can be achieved as the communication cost becomes smaller and smaller.