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
On the Influence of Start-Up Costs in Scheduling Divisible Loads on Bus Networks
IEEE Transactions on Parallel and Distributed Systems
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
Speedup of Parallel Processing of Divisible Loads on k-dimensional Meshes and Tori
PDPTA '02 Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications - Volume 1
Scheduling data intensive parallel processing in distributed and networked environments
Scheduling data intensive parallel processing in distributed and networked environments
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Improved Methods for Divisible Load Distribution on k-Dimensional Meshes Using Multi-Installment
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
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 {\rm 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 \beta+ 1, where \beta is the ratio of the time for computing a unit load to the time for communicating a unit load. Such performance is even better than that of the known methods on \kappa-dimensional meshes with \kappa gt; 1. The two new algorithms which use pipelined communications are generalized to distribute divisible loads on \kappa-dimensional meshes, and we show that the asymptotic speedup of both algorithms is \kappa \beta+ 1, where \kappa\geqslant 1. We also prove that on \kappa-dimensional meshes where \kappa\geqslant 1, as the network size becomes large, the asymptotic speedup of 2\kappa \beta+ 1 can be achieved for processing divisible loads by using interior initial processors.