By Topic

Fast large file distribution in data grid

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

3 Author(s)
Tao Li ; School of Computer Science and Engineering, Beihang University, Beijing, China ; Binghang Yan ; Zhongzhi Luan

With more and more data created by grid computing, large file distribution is a key issue in data grid. Current file distribution in data grid is usually a style site-to-site and this mechanism is not efficient and wastes bandwidth. In this paper, we propose a novel algorithm to distribute large file efficiently in data grid. We split the file into n subfiles and transfer each subfile to a different node. And then the node which receives a subfile transfers the subfile to other nodes. The size of each subfile is different in different network environment. We must compute the size of the subfile using our simple but efficient algorithm before file splitting. To verify the performance of our algorithm, we build a simulation system and compare with Multiunicast and FastReplica. The result shows our algorithm significantly reduce the file distribution time.

Published in:

Intelligent Computing and Integrated Systems (ICISS), 2010 International Conference on

Date of Conference:

22-24 Oct. 2010