BTS: Resource capacity estimate for time-targeted science workflows

被引:80
作者
Byun, Eun-Kyu [2 ]
Kee, Yang-Suk [3 ]
Kim, Jin-Soo [1 ]
Deelman, Ewa [4 ]
Maeng, Seungryoul [2 ]
机构
[1] Sungkyunkwan Univ, Sch Informat & Commun Eng, Suwon 440746, Gyeonggi Do, South Korea
[2] Korea Adv Inst Sci & Technol, Dept Comp Sci, Taejon 305701, South Korea
[3] Oracle USA Inc, Redwood Shores, CA 94065 USA
[4] Univ So Calif, Inst Informat Sci, Marina Del Rey, CA 90292 USA
关键词
Workflow management; Resource allocation; Cloud computing; Distributed system; Scientific application; TASK;
D O I
10.1016/j.jpdc.2011.01.008
中图分类号
TP301 [理论、方法];
学科分类号
080201 [机械制造及其自动化];
摘要
Workflow technologies have become a major vehicle for easy and efficient development of scientific applications. A critical challenge in integrating workflow technologies with state-of-the-art resource provisioning technologies is to determine the right amount of resources required for the execution of workflows. This paper introduces an approximation algorithm named BTS (Balanced Time Scheduling), which estimates the minimum number of computing hosts required to execute workflows within a user-specified finish time. The experimental results, based on a number of synthetic workflows and several real science workflows, demonstrate that the BTS estimate of resource capacity approaches to the theoretical lower bound. The BTS algorithm is scalable and its turnaround time is only tens of seconds, even with huge workflows with thousands of tasks and edges. Moreover, BTS achieves good performance with workflows having MPI-like parallel tasks. Finally, BTS can be easily integrated with any resource description languages and resource provisioning systems since the resource estimate of BTS is abstract. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码:848 / 862
页数:15
相关论文
共 49 条
[1]
COMPARISON OF LIST SCHEDULES FOR PARALLEL PROCESSING SYSTEMS [J].
ADAM, TL ;
CHANDY, KM ;
DICKSON, JR .
COMMUNICATIONS OF THE ACM, 1974, 17 (12) :685-690
[2]
*AM, AM SIMPL STOR SERV A
[3]
ANJONSHOAA A, JOB SUBMISSION DESCR
[4]
[Anonymous], 2008, P 3 WORKSH WORKFL SU
[5]
[Anonymous], AM EL COMP CLOUD EC2
[6]
[Anonymous], P 5 IEEE INT S CLUST
[7]
[Anonymous], 2005, P 1 IEEE INT C E SCI
[8]
BROWN DA, 2006, WORKFLOWS E SCI
[9]
Scheduling parameter sweep applications on global Grids: a deadline and budget constrained cost-time optimization algorithm [J].
Buyya, R ;
Murshed, M ;
Abramson, D ;
Venugopal, S .
SOFTWARE-PRACTICE & EXPERIENCE, 2005, 35 (05) :491-512
[10]
*COND TEAM, 2002, DIR AC GRAPH MAN