A strategy for scheduling tightly coupled parallel applications on clusters
Article first published online: 27 OCT 2009
Copyright © 2009 John Wiley & Sons, Ltd.
Concurrency and Computation: Practice and Experience
Volume 21, Issue 18, pages 2491–2517, 25 December 2009
How to Cite
Sanjay, H. A. and Vadhiyar, S. S. (2009), A strategy for scheduling tightly coupled parallel applications on clusters. Concurrency Computat.: Pract. Exper., 21: 2491–2517. doi: 10.1002/cpe.1534
- Issue published online: 5 NOV 2009
- Article first published online: 27 OCT 2009
- Manuscript Revised: 27 AUG 2009
- Manuscript Accepted: 27 AUG 2009
- Manuscript Received: 2 AUG 2008
- Department of Science and Technology, India. Grant Number: SR/S3/EECE/59/2005/8.6.06
- tightly coupled parallel applications;
Although various strategies have been developed for scheduling parallel applications with independent tasks, very little work exists for scheduling tightly coupled parallel applications on cluster environments. In this paper, we compare four different strategies based on performance models of tightly coupled parallel applications for scheduling the applications on clusters. In addition to algorithms based on existing popular optimization techniques, we also propose a new algorithm called Box Elimination that searches the space of performance model parameters to determine the best schedule of machines. By means of real and simulation experiments, we evaluated the algorithms on single cluster and multi-cluster setups. We show that our Box Elimination algorithm generates up to 80% more efficient schedules than other algorithms. We also show that the execution times of the schedules produced by our algorithm are more robust against the performance modeling errors. Copyright © 2009 John Wiley & Sons, Ltd.