Reliable budget aware workflow scheduling strategy on multi-cloud environment

被引:25
作者
Chakravarthi, K. Kalyana [1 ]
Neelakantan, P. [2 ]
Shyamala, L. [3 ]
Vaidehi, V. [4 ]
机构
[1] Caterpillar India Engn Solut Pvt Ltd, Chennai, Tamil Nadu, India
[2] VNR Vignana Jyothi Inst Engn & Technol, Hyderabad, India
[3] VIT, Chennai, Tamil Nadu, India
[4] Mother Theresa Womens Univ, Kodaikanal, India
来源
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS | 2022年 / 25卷 / 02期
关键词
Scientific workflows; Multi-Cloud systems; IaaS; Scheduling; Reliability; DAG; Budget constraint; SCIENTIFIC WORKFLOWS; RELIABILITY; ALGORITHM; TIME; PERFORMANCE; TASKS; COST; MAKESPAN; SERVICES; ENERGY;
D O I
10.1007/s10586-021-03464-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The resource provisioning and workflow execution in a multi-cloud environment using a pay-as-you-use framework have recently gained the attention of the cloud computing research community. Scheduling of workflows in the multi-cloud platform is challenging due to the cloud dynamics, particularly, heterogeneous resource types, multiple billing mechanisms, elasticity, on-demand provisioning, and systems reliability. In addition, these workflow applications have a runtime constraint-the most typical being the execution time and the execution cost. Another vital Quality of Service (QoS) metric that is of critical concern is reliability. This paper proposes a Normalization based Reliable Budget constraint Workflow Scheduling (NRBWS) algorithm to improve the workflow execution reliability and reduce the makespan under the budget constraint specified by the user. This scheme undergoes a min-max normalization process that is trailed by the computation of the expect reasonable budget (erb) to assign the tasks to one of the computational resources. The NRBWS algorithm lowers the makespan by assigning each workflow task to the most reliable computing resource with the earliest finish time under the allocated budget. Simulation results demonstrate that the proposed NRBWS algorithm outperforms existing state-of-the-art heuristics.
引用
收藏
页码:1189 / 1205
页数:17
相关论文
共 65 条
[1]   Deadline-constrained workflow scheduling algorithms for Infrastructure as a Service Clouds [J].
Abrishami, Saeid ;
Naghibzadeh, Mahmoud ;
Epema, Dick H. J. .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2013, 29 (01) :158-169
[2]   A Task Scheduling Algorithm With Improved Makespan Based on Prediction of Tasks Computation Time algorithm for Cloud Computing [J].
Al-Maytami, Belal Ali ;
Fan, Pingzhi ;
Hussain, Abir ;
Baker, Thar ;
Liatsist, Panos .
IEEE ACCESS, 2019, 7 :160916-160926
[3]   Maximizing the completion rate of concurrent scientific applications under time and budget constraints [J].
Arabnejad, Hamid ;
Barbosa, Jorge G. .
JOURNAL OF COMPUTATIONAL SCIENCE, 2017, 23 :120-129
[4]   Multi-QoS constrained and Profit-aware scheduling approach for concurrent workflows on heterogeneous systems [J].
Arabnejad, Hamid ;
Barbosa, Jorge G. .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2017, 68 :211-221
[5]   Multi-Workflow QoS-Constrained Scheduling for Utility Computing [J].
Arabnejad, Hamid ;
Barbosa, Jorge G. .
2015 IEEE 18TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE), 2015, :137-144
[6]   Generalized Nash Equilibria for the Service Provisioning Problem in Multi-Cloud Systems [J].
Ardagna, Danilo ;
Ciavotta, Michele ;
Passacantando, Mauro .
IEEE TRANSACTIONS ON SERVICES COMPUTING, 2017, 10 (03) :381-395
[7]   CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms [J].
Calheiros, Rodrigo N. ;
Ranjan, Rajiv ;
Beloglazov, Anton ;
De Rose, Cesar A. F. ;
Buyya, Rajkumar .
SOFTWARE-PRACTICE & EXPERIENCE, 2011, 41 (01) :23-50
[8]   Budget aware scheduling algorithm for workflow applications in IaaS clouds [J].
Chakravarthi, K. ;
Shyamala, L. ;
Vaidehi, V. .
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2020, 23 (04) :3405-3419
[9]  
Chen W., 2011, Workflows in support of large-scale science, P11, DOI [10.1007/978-3-642-31500-82, DOI 10.1145/2110497.2110500]
[10]   Toward an Optimal Online Checkpoint Solution under a Two-Level HPC Checkpoint Model [J].
Di, Sheng ;
Robert, Yves ;
Vivien, Frederic ;
Cappello, Franck .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2017, 28 (01) :244-259