A Data Transfer Scheme of Grid Workflow Based on Weighted Directed Graph

Author

Wu, Song ; Jin, Hai ; He, Kang ; Luo, Zongwei

Author_Institution

Sch. of Comput., Huazhong Univ. of Sci. & Technol., Wuhan

fYear

2006

fDate

Oct. 2006

Firstpage

491

Lastpage

495

Abstract

In a grid workflow, data transfer scheme plays a key role on its performance. In most grid projects, data is transferred between source and destination directly in the traditional way, without considering the status of network. In this paper, we present a data transfer scheme of grid workflow based on weighted directed graph. The scheme selects data transfer model according to the job´s data processing rate. Based on the different bandwidths between grid nodes, it builds a weighted directed graph to select a best transfer path. Simulation results show that the scheme can effectively improve the performance of grid workflows

Keywords

directed graphs; electronic data interchange; grid computing; workflow management software; data transfer scheme; grid workflow; job data processing rate; weighted directed graph; Bandwidth; Data processing; Dynamic programming; Dynamic scheduling; Grid computing; Protocols; Resource management; Service oriented architecture; Web services; Workflow management software;

fLanguage

English

Publisher

ieee

Conference_Titel

Grid and Cooperative Computing Workshops, 2006. GCCW '06. Fifth International Conference on

Conference_Location

Hunan

Print_ISBN

0-7695-2695-0

Type

conf

DOI

10.1109/GCCW.2006.4

Filename

4031597