2018
DOI: 10.1007/s13369-018-3664-6
|View full text |Cite
|
Sign up to set email alerts
|

Cost-Effective Algorithm for Workflow Scheduling in Cloud Computing Under Deadline Constraint

Abstract: Cloud computing is a popular model that allows users to store, access, process, and retrieve data remotely. It provides a high-performance computing with large scale of resources. However, this model requires an efficient scheduling strategy for resources management. Recently, several algorithms are presented to solve the resource scheduling problem. Nevertheless, still the problem exists with complex applications such as workflows, which need an efficient algorithm to be scheduled on the available resources. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0
1

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 48 publications
(17 citation statements)
references
References 23 publications
0
16
0
1
Order By: Relevance
“…This metric is used as a fitness function, consisting of total execution cost and load balancing on VMs. 4. Finally, we applied the proposed meta-heuristic algorithm IBO and other state-of-the-art algorithms based on metric as a centralized scheduler to schedule the single-workflow in CloudSim and compared their performance on standard scientific workflow applications.…”
Section: The Scope and Major Contribution Of The Paper Are Listed Asmentioning
confidence: 99%
“…This metric is used as a fitness function, consisting of total execution cost and load balancing on VMs. 4. Finally, we applied the proposed meta-heuristic algorithm IBO and other state-of-the-art algorithms based on metric as a centralized scheduler to schedule the single-workflow in CloudSim and compared their performance on standard scientific workflow applications.…”
Section: The Scope and Major Contribution Of The Paper Are Listed Asmentioning
confidence: 99%
“…PSO allows for multiple level modifications, right from its fitness function, to its velocity equations. One such modification is done in [5,20], where the fitness and velocity update equations are optimized in order to minimize the response time of the algorithm. The modified PSO reduces the response time of the algorithm by more than 10%, and can be used for fast-scheduling of resources in the cloud.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Numerous workflow designed applications are stored in cloud. The proposed algorithm [21], Extended dynamic constraint algorithm (add-on of multiple choice knapsack problem-MCKP) was compared with prevailing scheduling algorithm -Extended Dynamic Constraint Algorithm (EDCA). It guaranteed that monetary cost is optimized along with secure and reliable operation.…”
Section: Related Workmentioning
confidence: 99%