2006 Fifth International Symposium on Parallel and Distributed Computing 2006
DOI: 10.1109/ispdc.2006.9
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of Dynamic Heuristics for Workflow Scheduling on Grid Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
12
0

Year Published

2008
2008
2021
2021

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 28 publications
(12 citation statements)
references
References 12 publications
0
12
0
Order By: Relevance
“…1. Comparative studies in [25,101,165] show that static scheduling outperforms dynamic scheduling in most cases from different perspectives. The reason is that static scheduling is able to globally search from solution space at workflow level.…”
Section: Taxonomy Of Workflow Schedulingmentioning
confidence: 99%
“…1. Comparative studies in [25,101,165] show that static scheduling outperforms dynamic scheduling in most cases from different perspectives. The reason is that static scheduling is able to globally search from solution space at workflow level.…”
Section: Taxonomy Of Workflow Schedulingmentioning
confidence: 99%
“…Lòpez and Senar [26] analyzed the performance of several DAG scheduling heuristics and their counterpart dynamic version (with rescheduling) with a stochastic model. However, these studies do not address the issue of how to take advantage of a stochastic model to produce efficient full-ahead schedules for the DAGs.…”
Section: Background and Related Workmentioning
confidence: 99%
“…Lòpez and Senar [34] analyzed the performance of several DAG scheduling heuristics and their counterpart dynamic version (with rescheduling) with a stochastic model. However, these studies do not address the issue of how to take advantage of a stochastic model to produce efficient full-ahead schedules for the DAGs.…”
Section: Background and Related Workmentioning
confidence: 99%