Load-balancing scatter operations for grid computing
Parallel Computing
Adaptive grid job scheduling with genetic algorithms
Future Generation Computer Systems
Scheduling divisible loads in the dynamic heterogeneous grid environment
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Divisible Load Scheduling and Markov Chain Models
Computers & Mathematics with Applications
Genetic algorithm in grid scheduling with multiple objectives
AIKED'06 Proceedings of the 5th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Future Generation Computer Systems
Optimizing communications of data parallel programs in scalable cluster systems
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Localization techniques for cluster-based data grid
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Localized communications of data parallel programs on multi-cluster grid systems
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Optimizations of data distribution localities in cluster grid environments
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Multi-source task scheduling in grid computing environment using linear programming
International Journal of Computational Science and Engineering
| Hi-index | 0.00 |
In this paper,we iscuss several algorithms for scheduling divisible loads on heterogeneous systems. Our main contributions are (i) new optimality results for single-round algorithms and (ii) the design of an asymptotically optimal multi-round algorithm. This multi-round algorithm automatically performs resource selection, a dificult task that was previously left to the user. Because it is periodic, it is simpler to implement, and more robust to changes in the speeds of the processors and/or communication links. On the theoretical side, to the best of our knowledge, this is the first published result assessing the absolute performance of a multi-round algorithm. On the practical side, extensive simulations reveal that our multi-round algorithm outperforms existing solution on a large variety of platforms, especially when the communication-to-computation ratio is not very high (the difficult case).