End-to-End Delay Minimization for Scientific Workflows in Clouds under Budget Constraint

被引:82
作者
Wu, Chase Qishi [1 ]
Lin, Xiangyu [1 ]
Yu, Dantong [2 ]
Xu, Wei [2 ]
Li, Li [2 ]
机构
[1] Univ Memphis, Dept Comp Sci, Memphis, TN 38152 USA
[2] Brookhaven Natl Lab, Computat Sci Ctr, Upton, NY 11973 USA
关键词
Scientific workflows; workflow scheduling; cloud computing; PERFORMANCE;
D O I
10.1109/TCC.2014.2358220
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Next-generation e-Science features large-scale, compute-intensive workflows of many computing modules that are typically executed in a distributed manner. With the recent emergence of cloud computing and the rapid deployment of cloud infrastructures, an increasing number of scientific workflows have been shifted or are in active transition to cloud environments. As cloud computing makes computing a utility, scientists across different application domains are facing the same challenge of reducing financial cost in addition to meeting the traditional goal of performance optimization. We develop a prototype generic workflow system by leveraging existing technologies for a quick evaluation of scientific workflow optimization strategies. We construct analytical models to quantify the network performance of scientific workflows using cloud-based computing resources, and formulate a task scheduling problem to minimize the workflow end-to-end delay under a user-specified financial constraint. We rigorously prove that the proposed problem is not only NP-complete but also non-approximable. We design a heuristic solution to this problem, and illustrate its performance superiority over existing methods through extensive simulations and real-life workflow experiments based on proof-of-concept implementation and deployment in a local cloud testbed.
引用
收藏
页码:169 / 181
页数:13
相关论文
共 37 条
[1]   Deadline-constrained workflow scheduling in software as a service Cloud [J].
Abrishami, S. ;
Naghibzadeh, M. .
SCIENTIA IRANICA, 2012, 19 (03) :680-689
[2]  
[Anonymous], P 2011 INT C HIGH PE
[3]  
[Anonymous], 2008, Philippine Rats: Ecology and Management, DOI DOI 10.1109/SC.2008.5217932
[4]  
[Anonymous], P ACM IEEE SUP C
[5]  
[Anonymous], 1990, Knapsack Problems: Algorithms and ComputerImplementations
[6]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[7]  
[Anonymous], CASC APPL FRAM DEV R
[8]  
[Anonymous], 2003, ACM SIGOPS OPERATING
[9]  
[Anonymous], P 15 ACM MARD GRAS C
[10]  
[Anonymous], OOZIE WORKFLOW COORD