Enhanced Fast Spread Replication strategy for Data Grid

Authors:
Mohammad Bsoul;Ahmad Al-Khasawneh;Emad Eddien Abdallah;Yousef Kilani
Affiliations:
The Hashemite University, Faculty of Prince Al-Hussein Bin Abdallah II for Information Technology, Department of Computer Science and Applications (CSA), P.O. Box 150459, Zarqa 13115, Jordan;The Hashemite University, Faculty of Prince Al-Hussein Bin Abdallah II for Information Technology, Department of Computer Information Sciences (CIS), P.O. Box 150459, Zarqa 13115, Jordan;The Hashemite University, Faculty of Prince Al-Hussein Bin Abdallah II for Information Technology, Department of Computer Information Sciences (CIS), P.O. Box 150459, Zarqa 13115, Jordan;The Hashemite University, Faculty of Prince Al-Hussein Bin Abdallah II for Information Technology, Department of Computer Information Sciences (CIS), P.O. Box 150459, Zarqa 13115, Jordan
Venue:
Journal of Network and Computer Applications
Year:
2011

Citing 11
Cited 7

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
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 survey of dynamic replication strategies for improving data availability in data grids

Future Generation Computer Systems
A dynamic replica management strategy in data grid

Journal of Network and Computer Applications
Replication techniques in data grid environments

ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
A cloud architecture with an efficient scheduling technique

ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
Cloud Computing: Locally Sub-Clouds instead of Globally One Cloud

International Journal of Cloud Applications and Computing
Enhanced Dynamic Hierarchical Replication and Weighted Scheduling Strategy in Data Grid

Journal of Parallel and Distributed Computing
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 used in Data Grid to enhance data availability and fault tolerance. However, replication should be used wisely because the storage size of each node reside on the Data Grid is limited. Thus, the node must accommodate only the important replicas. In this paper, a dynamic replication strategy that takes into account the number and frequency of requests, the size of the replica, and the last time the replica was requested is proposed. This strategy is an enhanced version of Fast Spread replication strategy. The simulation results show that the new proposed strategy attained better performance than Fast Spread with Least Recently Used (LRU) and Fast Spread with Least Frequently Used (LFU) in terms of total response time and total bandwidth consumption.