Abstract
Background: Cloud computing is used to deliver IT resources over the internet. Due to the popularity of cloud computing, nowadays, most of the scientific workflows are shifted towards this environment. Many algorithms have been proposed in the literature to schedule scientific workflows in the cloud, but their execution cost is very high as they are not meeting the user-defined deadline constraint.
Aims: This paper focuses on satisfying the user-defined deadline of a scientific workflow while minimizing the total execution cost.
Methods: So, to achieve this, we proposed a Cost-Effective under Deadline (CEuD) constraint workflow scheduling algorithm.
Results: The proposed CEuD algorithm considers all the essential features of the Cloud and resolves the major issues such as performance variation and acquisition delay.
Conclusion: We compared the proposed CEuD algorithm with the existing literature algorithms for scientific workflows (i.e., Montage, Epigenomics, and CyberShake) and obtained better results for minimizing the overall execution cost of the workflow while satisfying the user-defined deadline.
Keywords: Cloud computing, workflow scheduling, execution cost, deadline, acquisition delay, slack time.
Graphical Abstract
Recent Advances in Computer Science and Communications
Title:Cost-effective Heuristic Workflow Scheduling Algorithm in Cloud Under Deadline Constraint
Volume: 13 Issue: 6
Author(s): Jasraj Meena*Manu Vardhan
Affiliation:
- Department of Information Technology, Delhi Technological University, Delhi,India
Keywords: Cloud computing, workflow scheduling, execution cost, deadline, acquisition delay, slack time.
Abstract:
Background: Cloud computing is used to deliver IT resources over the internet. Due to the popularity of cloud computing, nowadays, most of the scientific workflows are shifted towards this environment. Many algorithms have been proposed in the literature to schedule scientific workflows in the cloud, but their execution cost is very high as they are not meeting the user-defined deadline constraint.
Aims: This paper focuses on satisfying the user-defined deadline of a scientific workflow while minimizing the total execution cost.
Methods: So, to achieve this, we proposed a Cost-Effective under Deadline (CEuD) constraint workflow scheduling algorithm.
Results: The proposed CEuD algorithm considers all the essential features of the Cloud and resolves the major issues such as performance variation and acquisition delay.
Conclusion: We compared the proposed CEuD algorithm with the existing literature algorithms for scientific workflows (i.e., Montage, Epigenomics, and CyberShake) and obtained better results for minimizing the overall execution cost of the workflow while satisfying the user-defined deadline.
Export Options
About this article
Cite this article as:
Meena Jasraj *, Vardhan Manu , Cost-effective Heuristic Workflow Scheduling Algorithm in Cloud Under Deadline Constraint, Recent Advances in Computer Science and Communications 2020; 13 (6) . https://dx.doi.org/10.2174/2213275912666190822113039
DOI https://dx.doi.org/10.2174/2213275912666190822113039 |
Print ISSN 2666-2558 |
Publisher Name Bentham Science Publisher |
Online ISSN 2666-2566 |

- Author Guidelines
- Bentham Author Support Services (BASS)
- Graphical Abstracts
- Fabricating and Stating False Information
- Research Misconduct
- Post Publication Discussions and Corrections
- Publishing Ethics and Rectitude
- Increase Visibility of Your Article
- Archiving Policies
- Peer Review Workflow
- Order Your Article Before Print
- Promote Your Article
- Manuscript Transfer Facility
- Editorial Policies
- Allegations from Whistleblowers