A strategy for scheduling tightly coupled parallel applications on clusters


Autoria(s): Sanjay, HA; Vadhiyar, Sathish S
Data(s)

01/12/2009

Resumo

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.

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/25291/1/fulltext1.pdf

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.

Publicador

John Wiley and Sons

Relação

http://www3.interscience.wiley.com/journal/122664028/abstract

http://eprints.iisc.ernet.in/25291/

Palavras-Chave #Supercomputer Education & Research Centre
Tipo

Journal Article

PeerReviewed