By Topic

Optimal number of replicas in data grid environment

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)
Yasser Mansouri ; Department of Computer Engineering, Ferdowsi University of Mashhad- Iran ; Mehran Garmehi ; Mahdi Sargolzaei ; Mahdieh Shadi

Data replication is a promising technique to increase access to performance and data availability in data grid (DG) systems. Current work on data replication in grid systems focuses on infrastructure for replication, and mechanisms for creating or deleting replicas. The problem to determine minimum number of replicas as well as their locations in DG has not been studied, well enough. In this paper, we propose an algorithm formulated by using dynamic programming-based algorithm to find optimal number of replicas (ONR) of a dataset over DG systems, so that the read cost (i.e. transferring object over the data grid systems to the end-user) and the cost of storage (i.e. site building cost) can be minimized. We have also proposed a sketch of the proof for our algorithm and its integrity.

Published in:

Distributed Framework and Applications, 2008. DFmA 2008. First International Conference on

Date of Conference:

21-22 Oct. 2008