Popularity-Driven Dynamic Replica Placement in Hierarchical Data Grids

Author(s):  
Mohammad Shorfuzzaman ◽  
Peter Graham ◽  
Rasit Eskicioglu
2008 ◽  
Vol 68 (12) ◽  
pp. 1517-1538 ◽  
Author(s):  
Jan-Jan Wu ◽  
Yi-Fang Lin ◽  
Pangfeng Liu

2009 ◽  
Vol 51 (3) ◽  
pp. 374-392 ◽  
Author(s):  
Mohammad Shorfuzzaman ◽  
Peter Graham ◽  
Rasit Eskicioglu

2010 ◽  
Vol 256 ◽  
pp. 012020 ◽  
Author(s):  
Mohammad Shorfuzzaman ◽  
Peter Graham ◽  
Rasit Eskicioglu

Author(s):  
Ghalem Belalem

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.


Sign in / Sign up

Export Citation Format

Share Document