2012 IEEE 10th International Symposium on Parallel and Distributed Processing With Applications 2012
DOI: 10.1109/ispa.2012.94
|View full text |Cite
|
Sign up to set email alerts
|

Fairness Resource Sharing for Dynamic Workflow Scheduling on Heterogeneous Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
50
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 57 publications
(53 citation statements)
references
References 8 publications
1
50
0
Order By: Relevance
“…The five algorithms are FDWS [15], OWM [14], Rank Hybd [13], on-line minmin, and on-line max-min, which can all handle multiple workflow scheduling in dynamic situations. Based on our experiments, FDWS leads to better performance in terms of TTR, win(%), and NTT, showing better QoS characteristics for a range Computing on Complex Environments, Working Group 3: Algorithms and tools for mapping and executing applications onto distributed and heterogeneous systems.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…The five algorithms are FDWS [15], OWM [14], Rank Hybd [13], on-line minmin, and on-line max-min, which can all handle multiple workflow scheduling in dynamic situations. Based on our experiments, FDWS leads to better performance in terms of TTR, win(%), and NTT, showing better QoS characteristics for a range Computing on Complex Environments, Working Group 3: Algorithms and tools for mapping and executing applications onto distributed and heterogeneous systems.…”
Section: Discussionmentioning
confidence: 99%
“…The fairness dynamic workflow scheduling (FDWS) algorithm was proposed in [15]. FDWS implements new strategies for selecting the tasks from the ready list and for assigning the processors to reduce the individual completion time of the workflows, e.g., the turnaround time, including execution time and waiting time.…”
Section: Fairness Dynamic Workflow Schedulingmentioning
confidence: 99%
“…There are some algorithms proposed specifically to schedule concurrent workflows to improve individual QoS, namely, RANK HYBD [5] and Fairness Dynamic Workflow Scheduling (FDWS) [6]. The first algorithm minimize the average completion time of all workflows.…”
Section: Grid Marketmentioning
confidence: 99%
“…To overcome these problems with the RANK HYBD algorithm, the FDWS algorithm was proposed in [6]. FDWS applied new strategies for selecting the tasks from the ready tasks pool and for assigning the processors to reduce the individual completion time of the workflows, e.g., the turnaround time, including execution time and waiting time.…”
Section: Grid Marketmentioning
confidence: 99%
See 1 more Smart Citation