Parallel image processing applications on a network of workstations
Parallel Computing
Modeling communication pipeline latency
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
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
Parallel Processor Configuration Design with Processing/Transmission Costs
IEEE Transactions on Computers
Mathematics and Computers in Simulation
Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
Optimal Scheduling Algorithms for Communication Constrained Parallel Processing
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Performance limits of divisible load processing in systems with limited communication buffers
Journal of Parallel and Distributed Computing
Multiround Algorithms for Scheduling Divisible Loads
IEEE Transactions on Parallel and Distributed Systems
Computing BLAS level-2 operations on workstation clusters using the divisible load paradigm
Mathematical and Computer Modelling: An International Journal
Out-of-core divisible load processing
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
ETSA: an efficient task scheduling algorithm in wireless sensor networks
ICICA'10 Proceedings of the First international conference on Information computing and applications
An incentive-based distributed mechanism for scheduling divisible loads in tree networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.01 |
In the divisible load distribution, the classic methods on linear arrays divide the computation and communication processes into multiple time intervals in a pipelined fashion. Li (2003) has proposed a set of improved algorithms for linear arrays which can be generalized to k-dimensional meshes. In this paper, we first propose the algorithm M (multi-installment) that employs the multi-installment technique to improve the best algorithm Q proposed by Li. Second, we propose the algorithm S (start-up cost) that includes the computation and communication start-up costs in the design. While the asymptotic speedups of our algorithms M and S derived from the closed-form solutions are the same as algorithm Q, our algorithms approach the optimal speedups considerably faster than algorithm Q as the number of processors increases. Finally, we combine algorithms M and S and propose the algorithm MS. While algorithm MS has the same the asymptotic performance as algorithms Q and S, it achieves a better speedup when the load to be processed is very large and the number of processors is fixed or when the load to be processed is fixed and the number of processors is small.