Branch replication scheme: A new model for data replication in large scale data grids

Pérez, José Manuel Gómez; Garcı́a-Carballeira, Félix; Carretero, Jesús; Calderón, Alejandro; Fernández, Julia Martínez

doi:10.1016/j.future.2009.05.015

Cited by 70 publications

(37 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Perez et al [43] present Branch Replication Scheme (BRS) that has three key features: (i) sub-replica creation optimizes storage usage, (ii) data access performance is increased via parallel I/O, and (iii) consistency on updates are maintained to allow replica modification. In BRS, files are divided into several disjoint sub-replicas that are placed on different nodes.…”

Section: Dynamic Replication Strategies For Other Hierarchical Architmentioning

confidence: 99%

Dynamic replication strategies in data grid systems: a survey

et al. 2015

View full text Add to dashboard Cite

In data grid systems, data replication aims to increase availability, fault tolerance, load balancing and scalability while reducing bandwidth consumption, and job execution time. Several classification schemes for data replication were proposed in the literature, (i) static vs. dynamic, (ii) centralized vs. decentralized, (iii) push vs. pull, and (iv) objective function based. Dynamic data replication is a form of data replication that is performed with respect to the changing conditions of the grid environment. In this paper, we present a survey of recent dynamic data replication strategies. We study and classify these strategies by taking the target data grid architecture as the sole classifier. We discuss the key points of the studied strategies and provide feature comparison of them according to important metrics. Furthermore, the impact of data grid architecture on dynamic replication performance is investigated in a simulation study. Finally, some important issues and open research problems in the area are pointed out. B Uras Tos

show abstract

Section: Dynamic Replication Strategies For Other Hierarchical Architmentioning

confidence: 99%

Dynamic replication strategies in data grid systems: a survey

et al. 2015

View full text Add to dashboard Cite

show abstract

“…In grid computing, there is no limitation on the number of users, departments or organizations. Besides that, the size of the data managed by data grids is continuously growing (Perez et al, 2010). In Data Grid, when a user requests a data, a large amount of bandwidth could be spent to send the data from the server to the client.…”

Section: Introductionmentioning

confidence: 99%

“…A data grid is composed of hundreds of geographically distributed computers and storage resources usually located under different places and enables users to share data and other resources. Replication strategies determine when and where to create a replica, taking into account of the factors such as request number of the data, network conditions, storage availability of nodes, etc (Perez et al, 2010;Sun et al, 2009).…”

Section: Introductionmentioning

confidence: 99%

“…Meanwhile, this technique restricts the availability of write operations since they cannot be executed at the failure of any copy. In BRS technique (Perez et al, 2010), the clients that who request for the data file, the replicas are created as close as possible to them. The root replica grows toward the clients in a branching way, slip replicas into several sub replicas (Ahmad et al, 2010c;2010d).…”

Section: Introductionmentioning

confidence: 99%

“…In this technique, the replica tree will be growing based on the client needs. In HRS technique, a hierarchical replication consists of a root database server and one or more database servers organized into a hierarchy topology (Perez et al, 2010). Using this technique, the data will be replicated or copy at all sites and has the highest storage of use.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model

Zin¹,

Adzhar²,

Abdalla³

et al. 2012

Journal of Computer Science

View full text Add to dashboard Cite

Abstract:A data grid is compose of hundreds of geographically distributed computers and storage resources usually locate under different places and enables users to share data and other resources. Problem statement: Data replication is one of the mechanisms in managing data grid architecture that receive particular attention since it can provide efficient access to data, fault tolerance, reduce access latency and also can enhance the performance of the system. However, during transaction deadlock may occur that can reduce the throughput by minimizing the available resources, so it becomes an important resource management problem in distributed systems. Approach: The Neighbor Replication on Grid Deadlock Detection (NRGDD) transaction model has been developed to handle two deadlock cycle problems on grid. By deploying this method, the transactions communicate with each other by passing the probe messages. The victim message has been used to detect the deadlock when the number of waiting resource by other transaction is highest and become as the cause of deadlock occurs. In addition, this transaction must be aborted to solve the problem. Results: NRGDD transaction model are able to detect and solve more than one cycle of deadlocks. Conclusion: NRGDD has resolve the deadlock problem by sending the minimum number of probes message to detect the deadlock and it can resolve the deadlock to ensure the transaction can be done smoothly.

show abstract

Strategies for replica consistency in data grid – a comprehensive survey

Vashisht¹,

Sharma

Kumar

2016

Concurrency and Computation

View full text Add to dashboard Cite

Summary Data grid provides an efficient solution for data‐oriented applications that need to manage and process large data sets located at geographically distributed storage resources. Data grid relies on data replicas to enhance the performance and to ensure the fault tolerant results to the users. Replicas are developed to increase the availability of data and to provide better data access. Replicas have their own advantages, but there are a number of issues that must be resolved. Among various existing issues, the critical concern is replica consistency. Various replica consistency strategies are available in the literature. These strategies rationalize and investigate various parameters like bandwidth consumption, access cost, scalability, execution time, storage consumption, staleness, and freshness of replicas. In this paper, several asynchronous replica consistencies are classified and analyzed based on various strategies such as topology, level of abstraction, update propagation, and locality. Some other strategies are also discussed and analyzed like adaptive consistency, quorum‐based consistency, load balancing, and agent‐based economically efficient, check‐pointing, fault tolerance, and conflict management. Parameters on which these strategies are analyzed are methodology, replication classification, consistency, grid topology, environment, evaluation parameters, and performance. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

Branch replication scheme: A new model for data replication in large scale data grids

Cited by 70 publications

References 22 publications

Dynamic replication strategies in data grid systems: a survey

Dynamic replication strategies in data grid systems: a survey

Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model

Strategies for replica consistency in data grid – a comprehensive survey

Contact Info

Product

Resources

About