By Topic

FIRE: A File Reunion Based Data Replication Strategy for Data Grids

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

2 Author(s)
Abdurrab, A.R. ; Dept. of Comput. Sci., San Diego State Univ., San Diego, CA, USA ; Tao Xie

Data grids provide large-scale geographically distributed data resources for data intensive applications such as high energy physics and bioinformatics. Optimizing the use of data resources to maximize the performance is critical for data grids. In this paper, we propose a novel dynamic data replication strategy called FIRE (file reunion), which is motivated by the observations that a group of jobs in a site tend to demand a common set of files distributed in a data grid. The basic idea of FIRE is to reunite the file set through data replication so that it resides with the job group on the same site. Extensive experiments using a well-known data grid simulator OptorSim and synthetic benchmarks demonstrate that compared with two existing schemes, LRU (Least Recently Used) and LFU (Least Frequently Used), FIRE performs obviously better in most scenarios.

Published in:

Cluster, Cloud and Grid Computing (CCGrid), 2010 10th IEEE/ACM International Conference on

Date of Conference:

17-20 May 2010