Scheduling of scientific workflows in the ASKALON Grid environment.

被引:17
作者
Wieczorek, M [1 ]
Prodan, R [1 ]
Fahringer, T [1 ]
机构
[1] Univ Innsbruck, Inst Comp Sci, A-6020 Innsbruck, Austria
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Scheduling is a key concern for the execution of performance-driven Grid applications. In this paper we comparatively examine different existing approaches for scheduling of scientific workflow applications in a Grid environment. We evaluate three algorithms namely genetic, HEFT, and simple "myopic" and compare incremental workflow partitioning against the full-graph scheduling strategy. We demonstrate experiments using real-world scientific applications covering both balanced (symmetric) and unbalanced (asymmetric) workflows. Our results demonstrate that full-graph scheduling with the HEFT algorithm performs best compared to the other strategies examined in this paper.
引用
收藏
页码:56 / 62
页数:7
相关论文
共 13 条
[1]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[2]  
[Anonymous], GRID RESOURCE MANAGE
[3]  
Blaha P, 2001, WIEN2K AUGMENTED PLA
[4]  
*COND TEAM, DAGM
[5]  
Deelman E, 2004, LECT NOTES COMPUT SC, V3165, P11
[6]  
DUAN RB, 2005, LECT NOTES COMPUTER
[7]  
FAHRINGER JQT, 2005, P IEEE INT S CLUST C
[8]  
GRAHAM RL, 1969, BELL SYST TECH J, V45, P1563
[9]  
PRODAN R, 2005, 29 S APPL COMP SAC 2
[10]  
RUTSCHMANN P, 2005, J HYDROINFORMATICS