Scheduling Multiple Parameter Sweep Workflow Instances on the Grid

Authors:
Sucha Smanchat;Maria Indrawan;Sea Ling;Colin Enticott;David Abramson
Affiliations:
-;-;-;-;-
Venue:
E-SCIENCE '09 Proceedings of the 2009 Fifth IEEE International Conference on e-Science
Year:
2009

Citing 0
Cited 4

Robust workflows for science and engineering

Proceedings of the 2nd Workshop on Many-Task Computing on Grids and Supercomputers
A Provenance-based Adaptive Scheduling Heuristic for Parallel Scientific Workflows in Clouds

Journal of Grid Computing
Scheduling parameter sweep workflow in the Grid based on resource competition

Future Generation Computer Systems
DDS: A deadlock detection-based scheduling algorithm for workflow computations in HPC systems with storage constraints

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Due to its ability to provide high-performance computing environment, the grid has become an important infrastructure to support eScience. To utilise the grid for parameter sweep experiments, workflow technology combined with tools such as Nimrod/K are used to orchestrate and automate scientific services provided on the grid. As parameter sweeping over a workflow needs to be executed numerous times, it is more efficient to execute multiple instances of the workflow in parallel. However, this parallel execution can be delayed as every workflow instance requires the same set of resources leading to resource competition problem. Although many algorithms exist for scheduling grid workflows, there is little effort in considering multiple workflow instances and resource competition in the scheduling process. In this paper, we proposed a scheduling algorithm for parameter sweep workflow based on resource competition. The proposed algorithm aims to support multiple workflow instances and avoid allocating resources with high resource competition to minimise delay due to the blocking of tasks. The result is evaluated using simulation to compare with an existing scheduling algorithm.