2021
DOI: 10.1007/s10586-021-03314-3
|View full text |Cite
|
Sign up to set email alerts
|

Workflow scheduling of scientific workflows under simultaneous deadline and budget constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(4 citation statements)
references
References 31 publications
0
4
0
Order By: Relevance
“…The projected start time of the first task issued to a virtual machine (VM) and the estimated finish time of the last work assigned to it set limits on these leasing periods [49]. Some algorithms in [33], [32], [5], [36], [41], [42], [45], [50], [52] use the dynamic provisioning strategy. At the beginning of application scheduling, the number of resources to be used remains unknown.…”
Section: A) Staticmentioning
confidence: 99%
See 2 more Smart Citations
“…The projected start time of the first task issued to a virtual machine (VM) and the estimated finish time of the last work assigned to it set limits on these leasing periods [49]. Some algorithms in [33], [32], [5], [36], [41], [42], [45], [50], [52] use the dynamic provisioning strategy. At the beginning of application scheduling, the number of resources to be used remains unknown.…”
Section: A) Staticmentioning
confidence: 99%
“…Numerous strategies for optimizing scientific workflows based on heuristics have been proposed such as BAGS [31], PDPPS [32], BDAS [33], FDHEFT [34], GRP-HEFT [36], NBWS [37], CTTSW [38], CTTWSDP [41], SRPSM [50], BDDC+BDC [42], MOWOS [56], MHPSLP [43] [51], SMWDSA [52], REWS [46], EViMA [45]. Heuristics are generally a collection of guidelines designed to solve certain problems [57].…”
Section: A) Optimization Strategy • Heuristicmentioning
confidence: 99%
See 1 more Smart Citation
“…Patel and Bhoi [ 16 ] reviewed several priority-based task scheduling algorithms and performed their comparison so that one can conclude which algorithm is more beneficial and can be approached for further research in the sector of cloud computing to resolve the existing issues which is a huge challenge to offer the best services to the user within less time. In this literature review article, the authors have analyzed various conventional scheduling algorithms in cloud computing and found that the PA-LBIMM algorithm is the best among all priority-based algorithms.…”
Section: Literature Reviewmentioning
confidence: 99%