By Topic

Fast Cascading Replication Strategy for 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
$31 $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

5 Author(s)
Liang Hong ; Coll. of Comput. & Commun. Eng., China Univ. of Pet., Dongying ; Qi Xue-dong ; Li Xia ; Li Zhen
more authors

More and more large amounts of data shared with researchers and workstations worldwide are generated by scientific experiments and engineering applications. High performance grids aim at facilitating the distribution of such data to geographically remote places. For high performance data grids where users require remote access to large files, dynamic replication is an efficient method to improve performance. In this paper, Fast Cascading, a new dynamic replication algorithm, is proposed for the multi-tier Data Grid. The simulation results obtained by Simulator OptorSim which has been modified show that this algorithm can reduce the average response time of data access greatly for random access pattern compared with other algorithms,such as Fast Spread, LRU and Economy-Zipf dynamic replication strategy, and the gain increases with the number of jobs submitted.

Published in:

Computer Science and Software Engineering, 2008 International Conference on  (Volume:3 )

Date of Conference:

12-14 Dec. 2008