TOPSIS inspired Budget and Deadline Aware Multi-Workflow Scheduling for Cloud

被引:26
作者
Chakravarthi, Koneti Kalyan [1 ]
Shyamala, L. [1 ]
机构
[1] VIT Chennai, Sch Comp Sci & Engn, Chennai, Tamil Nadu, India
关键词
TOPSIS; Quality of service; Budget; Deadline; Scheduling; Multiple workflows; TIME; ALGORITHMS; INFRASTRUCTURE; TASKS; MODEL;
D O I
10.1016/j.sysarc.2020.101916
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Scheduling is a decision-making mechanism that allows resource sharing among several activities by determining their order of execution on the available resources. In the heterogeneous distributed systems, it is a great challenge to schedule concurrent workflows submitted by different users at different times. Scheduling with deadline and budget constraints are becoming an even more challenging issue for cloud systems due to the cloud dynamics such as on-demand provisioning, elasticity, abundant resource types, and various pricing schemes. A well-managed budget and deadline constraint scheduling is required to optimize the system performance and end-user satisfaction. Hence, improving system performance and optimizing multiple scheduling criteria at the same time is a big challenge. To address these issues, a novel multi-workflow scheduling algorithm based on the Multi-Criteria Decision Making (MCDM) approach, TOPSIS (Technique of Order Preference by Similarity to Ideal Solution) is presented. A weighted sum of run time, cost and data transfer time are used to determine the optimal resource among the available resources in accordance with the task requirements. The performance of the proposed algorithm is compared with the state-of-the-art algorithms such as Budget-Heterogeneous Earliest Finish Time (BHEFT), Budget and Deadline Constraint Heterogeneous Earliest Finish Time (BDHEFT) and Cloud-based Workflow Scheduling Algorithm (CWSA) algorithms based on budget constraint,deadline constraint, and resource utilization. The experimental results demonstrate that the proposed T-BDMWS outperforms current state-of-the-art heuristics with the criteria of achieving the user-specified budget or deadline constraints and resource efficiency.
引用
收藏
页数:14
相关论文
共 69 条
[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]   Evaluation of the hotels e-services quality under the user's experience [J].
Alberto Carrasco, Ramon ;
Sanchez-Fernandez, Juan ;
Munoz-Leiva, Francisco ;
Francisca Blasco, Maria ;
Herrera-Viedma, Enrique .
SOFT COMPUTING, 2017, 21 (04) :995-1011
[3]   Elastic Scheduling of Scientific Workflows under Deadline Constraints in Cloud Computing Environments [J].
Anwar, Nazia ;
Deng, Huifang .
FUTURE INTERNET, 2018, 10 (01)
[4]  
Arabnejad H., 2014, HIGH PERFORM COMPUT, V14, P5, DOI [10.1002/9781118711897.ch9, DOI 10.1002/9781118711897.CH9]
[5]   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
[6]   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
[7]   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
[8]  
Arabnejad H, 2014, LECT NOTES COMPUT SC, V8584, P532, DOI 10.1007/978-3-319-09153-2_40
[9]   List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table [J].
Arabnejad, Hamid ;
Barbosa, Jorge G. .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (03) :682-694
[10]   Budget and Deadline Aware e-Science Workflow Scheduling in Clouds [J].
Arabnejad, Vahid ;
Bubendorfer, Kris ;
Ng, Bryan .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2019, 30 (01) :29-44