2009 Fifth IEEE International Conference on E-Science 2009
DOI: 10.1109/e-science.2009.49
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling Multiple Parameter Sweep Workflow Instances on the Grid

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2009
2009
2017
2017

Publication Types

Select...
4
2
2

Relationship

2
6

Authors

Journals

citations
Cited by 19 publications
(15 citation statements)
references
References 19 publications
(55 reference statements)
0
15
0
Order By: Relevance
“…When combined with the Nimrod/K engine, this will provide a very powerful distributed computing platform. Second, we are designing and building arrange of scheduling heuristics that work with the data transport and parallel computing models discussed [10] [27]. Third, we are building interfaces with powerful display technologies, and these allow a user to be immersed in the optimization process.…”
Section: Discussionmentioning
confidence: 99%
“…When combined with the Nimrod/K engine, this will provide a very powerful distributed computing platform. Second, we are designing and building arrange of scheduling heuristics that work with the data transport and parallel computing models discussed [10] [27]. Third, we are building interfaces with powerful display technologies, and these allow a user to be immersed in the optimization process.…”
Section: Discussionmentioning
confidence: 99%
“…Thus, the HEFT, min-min and max-min algorithms degrade to the MCT algorithm for this kind of tasks. Some other solutions [35,37,39] for SWf scheduling also focus on single site execution. These techniques do not consider the time to generate provenance data.…”
Section: Related Workmentioning
confidence: 99%
“…Our previous work in [8,13] addressed these issues but did not consider the data transfer time. In this paper, we explain our improved algorithm and describe a conceptual approach to implement a scheduling algorithm for a scheduler.…”
Section: Introductionmentioning
confidence: 96%
“…Since multiple instances of a parameter sweep workflow can be executed in parallel [7], the scheduling algorithm needs to be aware of the resource contention caused by a large number of tasks sharing the same set of resources. In this paper, we present an improved version of our algorithm proposed in [8] to achieve better performance of parameter sweep workflow execution. We also propose an implementation of a scheduler and its interaction with the scheduling algorithm, and highlight the issues encountered during our scheduler development.…”
Section: Introductionmentioning
confidence: 98%