By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Song Wu ; Sch. of Comput., Huazhong Univ. of Sci. & Technol., Wuhan ; Hai Jin ; Kang He ; Zongwei Luo

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

Published in:

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

Date of Conference:

Oct. 2006