Method for reducing cloud workflow completion time under the task interruption

doi:10.11959/j.issn.2096-109x.2020018

网络与信息安全学报 ›› 2020, Vol. 6 ›› Issue (3): 113-125.doi: 10.11959/j.issn.2096-109x.2020018

• 学术论文 • 上一篇

Method for reducing cloud workflow completion time under the task interruption

WANGYawen(),GUOYunfei,LIUWenyan,HUOShumin

National Digital Switching System Engineering and Technology Research Center,Zhengzhou,China

修回日期:2019-08-09 出版日期:2020-06-01 发布日期:2020-07-01
作者简介:Yawen WANG (1990- ),born in Henan. He is working on his Ph.D degree at National Digital Switching System Engineering and Technological Research Center. His research interests include cloud security and scientific workflow scheduling.|Yunfei GUO (1963- ),born in Henan. He is a Ph.D supervisor and professor at National Digital Switching System Engineering and Technological Research Center. His research interests include cloud security and telecommunication network security.|Wenyan LIU (1986- ),born in Henan. He is a lecturer at National Digital Switching System Engineering and Technological Research Center. His research interests include cloud security.|Shumin HUO (1985- ),born in Shanxi. He is a lecturer at National Digital Switching System Engineering and Technological Research Center. His research interests include cloud security.

Revised:2019-08-09 Online:2020-06-01 Published:2020-07-01
Supported by:
The National Key R ＆ D Program of China(2018YFB0804004)

摘要/Abstract

摘要：

As more and more large-scale scientific workflows are delivered to clouds,the business model of workflow-as-a-service is emerging.But there are many kinds of threats in the cloud environment,which can interrupt the task execution and extend the workflow completion time.As an important QoS parameter,the workflow completion time is determined by the critical task path.Therefore,critical path redundancy method is proposed to create a redundant path having the interact parallel relationship with the critical path,which can provide the protection for the tasks in the critical path and reduce the probability of the critical path interruption.Computing instance allocation is an essential part of the cloud workflow execution,since only the tasks assigned the instance can begin execution.In order to further reduce the workflow completion time,computing instance allocation algorithm based on HEFT (heterogeneous earliest finish time) is proposed.The algorithm considers diverse task dependency relationships and takes full advantages of the critical path redundancy method,which can improve the efficiency of workflow execution.Experimental results demonstrate that the proposed method can effectively reduce the cloud workflow completion time under the task interruption.

Abstract:

Key words: cloud workflow, task interruption, resource allocation, fault tolerance

WANGYawen,GUOYunfei,LIUWenyan,HUOShumin. Method for reducing cloud workflow completion time under the task interruption[J]. 网络与信息安全学报, 2020, 6(3): 113-125.

图/表 13

Figure 1

Figure 2

Figure 3

Figure 4

Figure 5

Table 1

Table 2

Table 3

Table 4

Figure 6

Figure 7

Figure 8

Figure 9

参考文献 26

[1]	LIU L , ZHANG M , BUYYA R ,et al. Deadline-constrained coevolutionary genetic algorithm for scientific workflow scheduling in cloud computing[J]. Concurrency and Computation:Practice and Experience, 2017,29(5): 1-12.
[2]	RODRIGUEZ M A , BUYYA R . A taxonomy and survey on scheduling algorithms for scientific workflows in IaaS cloud computing environments[J]. Concurrency and Computation:Practice and Experience, 2017,29(8): 1-23.
[3]	WANG M , ZHU L , Chen J . Risk-aware checkpoint selection in cloud-based scientific workflow[C]// 2012 Second International Conference on Cloud and Green Computing. 2012: 137-144.
[4]	ABRISHAMI S , NAGHIBZADEH M , EPEMA D H J . Deadline-constrained workflow scheduling algorithms for infrastructure as a service clouds[J]. Future Generation Computer Systems, 2013,29(1): 158-169.
[5]	WU Q , ISHIKAWA F , ZHU Q ,et al. Deadline-constrained cost optimization approaches for workflow scheduling in clouds[J]. IEEE Transactions on Parallel and Distributed Systems, 2017,28(12): 3401-3412.
[6]	CALHEIROS R N , BUYYA R . Meeting deadlines of scientific workflows in public clouds with tasks replication[J]. IEEE Transactions on Parallel and Distributed Systems, 2013,25(7): 1787-1796.
[7]	VERMA A , KAUSHAL S . Deadline constraint heuristic-based genetic algorithm for workflow scheduling in cloud[J]. International Journal of Grid and Utility Computing, 2014,5(2): 96-106.
[8]	DELDARI A , NAGHIBZADEH M , ABRISHAMI S . CCA:a deadline-constrained workflow scheduling algorithm for multicore resources on the cloud[J]. The journal of Supercomputing, 2017,73(2): 756-781.
[9]	LIN B , GUO W , LIN X . Online optimization scheduling for scientific workflows with deadline constraint on hybrid clouds[J]. Concurrency and Computation:Practice and Experience, 2016,28(11): 3079-3095.
[10]	ZHENG W , HUANG S . An adaptive deadline constrained energy‐efficient scheduling heuristic for workflows in clouds[J]. Concurrency and Computation:Practice and Experience, 2015,27(18): 5590-5605.
[11]	SAHNI J , VIDYARTHI D P . A cost-effective deadline-constrained dynamic scheduling algorithm for scientific workflows in a cloud environment[J]. IEEE Transactions on Cloud Computing, 2015,6(1): 2-18.
[12]	YAO G , DING Y , REN L ,et al. An immune system-inspired rescheduling algorithm for workflow in cloud systems[J]. Knowledge-Based Systems, 2016,99: 39-50.
[13]	DING Y , YAO G , HAO K . Fault-tolerant elastic scheduling algorithm for workflow in cloud systems[J]. Information Sciences, 2017,393: 47-65.
[14]	WANG Y , WU J , GUO Y ,et al. Scientific workflow execution system based on mimic defense in the cloud environment[J]. Frontiers of Information Technology ＆ Electronic Engineering, 2018,19(12): 1522-1536.
[15]	POOLA D , RAMAMOHANARAO K , BUYYA R . Fault-tolerant workflow scheduling using spot instances on clouds[J]. Procedia Computer Science, 2014,29: 523-533.
[16]	POOLA D , RAMAMOHANARAO K , BUYYA R . Enhancing reliability of workflow execution using task replication and spot instances[J]. ACM Transactions on Autonomous and Adaptive Systems (TAAS), 2016,10(4):30.
[17]	YAO G , DING Y , HAO K . Using imbalance characteristic for fault-tolerant workflow scheduling in cloud systems[J]. IEEE Transactions on Parallel and Distributed Systems, 2017,28(12): 3671-3683.
[18]	ZHENG Z , ZHOU T C , LYU M R ,et al. Component ranking for fault-tolerant cloud applications[J]. IEEE Transactions on Services Computing, 2011,5(4): 540-550.
[19]	TOPCUOGLU H , HARIRI S , WU M . Performance-effective and low-complexity task scheduling for heterogeneous computing[J]. IEEE transactions on parallel and distributed systems, 2002,13(3): 260-274.
[20]	VERMA A , MITTAL M , CHHABRA B . The mutual authentication scheme to detect virtual side channel attack in cloud computing[J]. International Journal of Computer Science and Information Security (IJCSIS), 2017,15(3).
[21]	GROBAUER B , WALLOSCHEK T , Stocker E . Understanding cloud computing vulnerabilities[J]. IEEE Security ＆ privacy, 2010,9(2): 50-57.
[22]	MISHRA P , PILLI E S , VARADHARAJAN V ,et al. Intrusion detection techniques in cloud environment:A survey[J]. Journal of Network and Computer Applications, 2017,77: 18-47.
[23]	STEWIN P , BYSTROV I . Understanding DMA malware[C]// International Conference on Detection of Intrusions and Malware,and Vulnerability Assessment. 2012: 21-41.
[24]	CHEN W , DEELMAN E . WorkflowSim:a toolkit for simulating scientific workflows in distributed environments[C]// 2012 IEEE 8th International Conference on E-Science. 2012: 1-8.
[25]	JUVE G , CHERVENAK A , DEELMAN E ,et al. Characterizing and profiling scientific workflows[J]. Future Generation Computer Systems, 2013,29(3): 682-692.
[26]	DEELMAN E , VAHI K , JUVE G ,et al. Pegasus,a workflow management system for science automation[J]. Future Generation Computer Systems, 2015,46: 17-35.

computing instances			Tasks
computing instances	v₁	v₂	v₃	v₄	v₅	v₆
p₁	8	7	9	10	6	8
p₂	9	8	10	11	7	9
p₃	10	9	11	12	8	10

Edge	e _1,2	e _1,4	e_2,3	e_2,5	e _3,6	e _5,6
Time	1	3	1	2	2	1

v_i	rank _u(v_i)	rank _d(v_i)	rank _u+d(v_i)
v₁	43	0	43
v₂	30	10	40
v₃	21	19	40
v₄	31	12	43
v₅	17	26	43
v₆	9	34	43

Workflow	Number of tasks	Number of edges	Average data size/MB	Average task runtime/s
CyberShake(1 000)	1 000	3 988	102.29	22.71
Epigenomics(997)	997	3 228	388.59	3 858.67
Montage(1 000)	1 000	4 485	3.21	11.36
Inspiral(1 000)	1 000	3 246	8.90	227.25

Method for reducing cloud workflow completion time under the task interruption

在线阅读

pdf下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 13

参考文献 26

相关文章 0

Metrics

推荐阅读 0