A Comparative Study of Replica Placement Strategies in Data Grids

2007 ◽  
pp. 135-143 ◽  
Author(s):  
Qaisar Rasool ◽  
Jianzhong Li ◽  
George S. Oreku ◽  
Ehsan Ullah Munir ◽  
Donghua Yang
Keyword(s):  
Comparative Study ◽  
Replica Placement ◽  
Data Grids

Policy Driven Negotiation to Improve the QoS in Data Grid

2010 ◽  
pp. 1041-1056
Author(s):  
Ghalem Belalem
Keyword(s):  
Large Scale ◽  
Data Access ◽  
Data Grid ◽  
Management Service ◽  
Replica Placement ◽  
Data Grids ◽  
Large Scale Systems ◽  
Consistency Management ◽  
Access Latency ◽  
Replicated Data

Data grids have become an interesting and popular domain in grid community (Foster and Kesselmann, 2004). Generally, the grids are proposed as solutions for large scale systems, where data replication is a well-known technique used to reduce access latency and bandwidth, and increase availability. In splitting of the advantages of replication, there are many problems that should be solved such as, • The replica placement that determines the optimal locations of replicated data in order to reduce the storage cost and data access (Xu et al, 2002); • The problem of determining which replica will be accessed to in terms of consistency when we need to execute a read or write operation (Ranganathan and Foster, 2001); • The problem of degree of replication which consists in finding a minimal number of replicas without reducing the performance of user applications; • The problem of replica consistency that concerns the consistency of a set of replicated data. This consistency provides a completely coherent view of all the replicas for a user (Gray et al 1996). Our principal aim, in this article, is to integrate into consistency management service, an approach based on an economic model for resolving conflicts detected in the data grid.

scholarly journals Optimal replica placement in hierarchical Data Grids with locality assurance

2008 ◽  
Vol 68 (12) ◽  
pp. 1517-1538 ◽  
Author(s):  
Jan-Jan Wu ◽  
Yi-Fang Lin ◽  
Pangfeng Liu
Keyword(s):  
Hierarchical Data ◽  
Replica Placement ◽  
Data Grids

Adaptive popularity-driven replica placement in hierarchical data grids

2009 ◽  
Vol 51 (3) ◽  
pp. 374-392 ◽  
Author(s):  
Mohammad Shorfuzzaman ◽  
Peter Graham ◽  
Rasit Eskicioglu
Keyword(s):  
Hierarchical Data ◽  
Replica Placement ◽  
Data Grids

scholarly journals Adaptive Replica Placement in Hierarchical Data Grids

2010 ◽  
Vol 256 ◽  
pp. 012020 ◽  
Author(s):  
Mohammad Shorfuzzaman ◽  
Peter Graham ◽  
Rasit Eskicioglu
Keyword(s):  
Hierarchical Data ◽  
Replica Placement ◽  
Data Grids

scholarly journals Efetividade da Política de Posicionamento de Blocos no Balanceamento de Réplicas do HDFS

2019 ◽  
Author(s):  
Rhauani W. Fazul ◽  
Patricia Pitthan Barcelos
Keyword(s):  
Comparative Study ◽  
Large Scale ◽  
Data Replication ◽  
Distributed File System ◽  
Replica Placement ◽  
System Behavior ◽  
Tolerance Mechanism ◽  
Transfer Data ◽  
Hadoop Distributed File System ◽  
Default Data

The Hadoop Distributed File System (HDFS) is designed to store and transfer data in large scale. To ensure availability and reliability, it uses data replication as a fault tolerance mechanism. However, this strategy can significantly affect replication balancing in the cluster. This paper provides an analysis of the default data replication policy used by HDFS and measures its impacts on the system behavior, while presenting different strategies for cluster balancing and rebalancing. In order to highlight the required requirements for efficient replica placement, a comparative study of the HDFS performance has been conduct considering a variety of factors that may result in cluster imbalance.

An efficient replica placement strategy in highly dynamic data grids

2011 ◽  
Vol 2 (2) ◽  
pp. 156 ◽  
Author(s):  
Faouzi Ben Charrada ◽  
Habib Ounelli ◽  
Hanene Chettaoui
Keyword(s):  
Replica Placement ◽  
Data Grids ◽  
Dynamic Data
Sign in / Sign up

Export Citation Format

Share Document