Multiple Workflow Scheduling Strategies with User Run Time Estimates on a Grid

  • Authors:

  • Adán Hirales-Carbajal;Andrei Tchernykh;Ramin Yahyapour;José Luis González-García;Thomas Röblitz;Juan Manuel Ramírez-Alcaraz

  • Affiliations:

  • Computer Science Department, CICESE Research Center, Ensenada, México;Computer Science Department, CICESE Research Center, Ensenada, México;GWDG --- University of Göttingen, Göttingen, Germany 37077;GWDG --- University of Göttingen, Göttingen, Germany 37077;GWDG --- University of Göttingen, Göttingen, Germany 37077;Colima University, Colima, México C.P. 28040

  • Venue:
  • Journal of Grid Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present an experimental study of deterministic non-preemptive multiple workflow scheduling strategies on a Grid. We distinguish twenty five strategies depending on the type and amount of information they require. We analyze scheduling strategies that consist of two and four stages: labeling, adaptive allocation, prioritization, and parallel machine scheduling. We apply these strategies in the context of executing the Cybershake, Epigenomics, Genome, Inspiral, LIGO, Montage, and SIPHT workflows applications. In order to provide performance comparison, we performed a joint analysis considering three metrics. A case study is given and corresponding results indicate that well known DAG scheduling algorithms designed for single DAG and single machine settings are not well suited for Grid scheduling scenarios, where user run time estimates are available. We show that the proposed new strategies outperform other strategies in terms of approximation factor, mean critical path waiting time, and critical path slowdown. The robustness of these strategies is also discussed.