UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Optimal Multi-installments Algorithm for Divisible Load Scheduling
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
The Journal of Supercomputing
A new algorithm for divisible load scheduling with different processor available times
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part I
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Inter-round scheduling for divisible workload applications
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Hi-index | 0.00 |
During the last decade, the use of parallel and distributed systems has become more common. Dividing data is one of the challenges in this type of systems. Divisible Load Theory (DLT) is one of the proposed method for scheduling data distribution in parallel or distributed systems. Many researches have been done in this field but scheduling a multi-installment heterogeneous system in which communication mode is blocking has not been addressed. In this paper, we present some closedform formulas for the different steps of scheduling jobs in this type of systems. The results of our experiments show the proposed method gave better performances than the Hsu et al.'s method