A threshold-based dynamic data replication strategy

Authors:
Mohammad Bsoul;Ahmad Al-Khasawneh;Yousef Kilani;Ibrahim Obeidat
Affiliations:
Department of Computer Science and Applications, The Hashemite University, Zarqa, Jordan 13115;Department of Computer Information System, The Hashemite University, Zarqa, Jordan 13115;Department of Computer Information System, The Hashemite University, Zarqa, Jordan 13115;Department of Computer Information System, The Hashemite University, Zarqa, Jordan 13115
Venue:
The Journal of Supercomputing
Year:
2012

Citing 12
Cited 2

The LRU-K page replacement algorithm for database disk buffering

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Identifying Dynamic Replication Strategies for a High-Performance Data Grid

GRID '01 Proceedings of the Second International Workshop on Grid Computing
Data Replication Strategies in Grid Environments

ICA3PP '02 Proceedings of the Fifth International Conference on Algorithms and Architectures for Parallel Processing
On Dynamic Replication Strategies in Data Service Grids

ISORC '08 Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing
A dynamic data replication strategy using access-weights in data grids

The Journal of Supercomputing
Optimal replica placement in hierarchical Data Grids with locality assurance

Journal of Parallel and Distributed Computing
Fast Cascading Replication Strategy for Data Grid

CSSE '08 Proceedings of the 2008 International Conference on Computer Science and Software Engineering - Volume 03
A Weight-Based Dynamic Replica Replacement Strategy in Data Grids

APSCC '08 Proceedings of the 2008 IEEE Asia-Pacific Services Computing Conference
Data Replication and the Storage Capacity of Data Grids

High Performance Computing for Computational Science - VECPAR 2008
A dynamic weighted data replication strategy in data grids

AICCSA '08 Proceedings of the 2008 IEEE/ACS International Conference on Computer Systems and Applications
Dynamic replication algorithms for the multi-tier Data Grid

Future Generation Computer Systems - Special issue: Parallel computing technologies
The complexity of static data replication in data grids

Parallel Computing

A novel dynamic network data replication scheme based on historical access record and proactive deletion

The Journal of Supercomputing
A standards-based framework of software configuration derived from system requirements

International Journal of Computer Applications in Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data replication is the creation and maintenance of multiple copies of the same data. Replication is used in Data Grid to enhance data availability and fault tolerance. One of the main objectives of replication strategies is reducing response time and bandwidth consumption. In this paper, a dynamic replication strategy that is based on Fast Spread but superior to it in terms of total response time and total bandwidth consumption is proposed. This is achieved by storing only the important replicas on the storage of the node. The main idea of this strategy is using a threshold to determine if the requested replica needs to be copied to the node. The simulation results show that the proposed strategy achieved better performance compared with Fast Spread with Least Recently Used (LRU), and Fast Spread with Least Frequently Used (LFU).