Scheduling multiple parameter sweep workflow instances on the grid

Smanchat, Sucha, Indrawan, Maria, Ling, Sea, Enticott, Colin and Abramson, David (2009). Scheduling multiple parameter sweep workflow instances on the grid. In: e-Science 2009 - 5th IEEE International Conference on e-Science: proceedings. 5th IEEE International Conference on e-Science, e-Science 2009, Oxford, United Kingdom, (300-306). 9-11 December 2009. doi:10.1109/e-Science.2009.49

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads

Author Smanchat, Sucha
Indrawan, Maria
Ling, Sea
Enticott, Colin
Abramson, David
Title of paper Scheduling multiple parameter sweep workflow instances on the grid
Conference name 5th IEEE International Conference on e-Science, e-Science 2009
Conference location Oxford, United Kingdom
Conference dates 9-11 December 2009
Proceedings title e-Science 2009 - 5th IEEE International Conference on e-Science: proceedings
Place of Publication Los Alamitos, CA United States
Publisher I E E E Computer Society
Publication Year 2009
Year available 2009
Sub-type Fully published paper
DOI 10.1109/e-Science.2009.49
Open Access Status
ISBN 9780769538778
0769538770
Start page 300
End page 306
Total pages 7
Collection year 2010
Language eng
Abstract/Summary 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.
Subjects 1200 Arts and Humanities
1700 Computer Science
1900 Earth and Planetary Sciences
3605 Health Information Management
Keyword Grid workflow
Parameter sweep
Resource competition
Workflow scheduling
Q-Index Code E1
Q-Index Status Provisional Code
Institutional Status Non-UQ

 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 7 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Tue, 26 Nov 2013, 13:40:02 EST by Ms Diana Cassidy on behalf of Research Computing Centre