Dynamic replication algorithms for the multi-tier Data Grid

2005 ◽  
Vol 21 (5) ◽  
pp. 775-790 ◽  
Author(s):  
Ming Tang ◽  
Bu-Sung Lee ◽  
Chai-Kiat Yeo ◽  
Xueyan Tang
Keyword(s):  
Data Grid ◽  
Dynamic Replication

Dynamic replication strategies in data grid

2008 ◽  
Vol 13 (4) ◽  
pp. 440-444
Author(s):  
Xiaohua Dong ◽  
Zhongfu Wu
Keyword(s):  
Data Grid ◽  
Dynamic Replication

Collaborative Services for Fault Tolerance in Hierarchical Data Grid

2014 ◽  
Vol 5 (1) ◽  
pp. 1-21 ◽  
Author(s):  
B. Meroufel ◽  
G. Belalem
Keyword(s):  
Fault Tolerance ◽  
System Reliability ◽  
High Performance ◽  
Data Grid ◽  
Data Availability ◽  
Fault Prediction ◽  
Grid Systems ◽  
Adaptive Dynamic ◽  
Dynamic Replication ◽  
Multiple Copies

As fault tolerance is the ability of a system to perform its function correctly even in the presence of faults. Therefore, different fault tolerance techniques are critical for improving the efficient utilization of expensive resources in high performance data grid systems. One of the most popular strategies of fault tolerance is the replication, it creates multiple copies of resources in the system and it has been proved to be an effective way to achieve data availability and system reliability. In this paper the authors propose a new adaptive dynamic replication that combines between a replication based on availability and replication based on popularity. The authors' adaptive dynamic replication uses two types of replicas (primary and ordinary) and two types of placement nodes (best client and best responsible nodes) for the new replicas. In addition to the replication, we used other strategies such as fault detection, fault prediction, dynamicity management, self-stabilization. All these services are grouped in one fault tolerance box named Collaborative Services for Fault Tolerance (CSFT) that structure them in hierarchical services and organize the relationships between them.

A dynamic replication strategy based on categorization for Data Grid

2014 ◽  
Vol 10 (2) ◽  
pp. 109-118 ◽  
Author(s):  
Mohammad Bsoul ◽  
Ayoub Alsarhan ◽  
Ahmed Otoom ◽  
Maen Hammad ◽  
Ahmad Al-Khasawneh
Keyword(s):  
Data Grid ◽  
Dynamic Replication ◽  
Replication Strategy

scholarly journals Efficient Dynamic Replication Algorithm Using Agent for Data Grid

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Priyanka Vashisht ◽  
Rajesh Kumar ◽  
Anju Sharma
Keyword(s):  
Data Replication ◽  
Data Access ◽  
Data Grid ◽  
Data Availability ◽  
Access Time ◽  
Test Bed ◽  
Data Grids ◽  
Dynamic Replication ◽  
Data Files ◽  
Using Data

In data grids scientific and business applications produce huge volume of data which needs to be transferred among the distributed and heterogeneous nodes of data grids. Data replication provides a solution for managing data files efficiently in large grids. The data replication helps in enhancing the data availability which reduces the overall access time of the file. In this paper an algorithm, namely, EDRA using agents for data grid, has been proposed and implemented. EDRA consists of dynamic replication of hierarchical structure taken into account for the selection of best replica. Decision for selecting the best replica is based on scheduling parameters. The scheduling parameters are bandwidth, load gauge, and computing capacity of the node. The scheduling in data grid helps in reducing the data access time. The distribution of the load on the nodes of data grid is done evenly by considering scheduling parameters. EDRA is implemented using data grid simulator, namely, OptorSim. European Data Grid CMS test bed topology is used in this experiment. The simulation results are obtained by comparing BHR, LRU, No Replication, and EDRA. The result shows the efficiency of EDRA algorithm in terms of mean job execution time, network usage, and storage usage of node.

Sign in / Sign up

Export Citation Format

Share Document