ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

A strategy for scheduling tightly coupled parallel applications on clusters

Sanjay, HA and Vadhiyar, Sathish S (2009) A strategy for scheduling tightly coupled parallel applications on clusters. In: Concurrency and Computation: Practice and Experience, 21 (18). pp. 2491-2517.

[img] PDF
fulltext1.pdf - Published Version
Restricted to Registered users only

Download (1382Kb) | Request a copy
Official URL: http://www3.interscience.wiley.com/journal/1226640...

Abstract

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 schedule 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.

Item Type: Journal Article
Additional Information: copyright of this article belongs to John Wiley and Sons.
Keywords: scheduling;tightly coupled parallel applications;clusters.
Department/Centre: Division of Information Sciences > Supercomputer Education & Research Centre
Date Deposited: 10 Jan 2010 11:17
Last Modified: 19 Sep 2010 05:53
URI: http://eprints.iisc.ernet.in/id/eprint/25291

Actions (login required)

View Item View Item