Dynamic replication algorithms for the multi-tier Data Grid

Authors:
Ming Tang;Bu-Sung Lee;Chai-Kiat Yeo;Xueyan Tang
Affiliations:
School of Computer Engineering Nanyang Technological University, Singapore, Singapore;School of Computer Engineering Nanyang Technological University, Singapore, Singapore;School of Computer Engineering Nanyang Technological University, Singapore, Singapore;School of Computer Engineering Nanyang Technological University, Singapore, Singapore
Venue:
Future Generation Computer Systems - Special issue: Parallel computing technologies
Year:
2005

Citing 6
Cited 7

An adaptive data replication algorithm

ACM Transactions on Database Systems (TODS)
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Giggle: a framework for constructing scalable replica location services

Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Performance Analysis of Scheduling and Replication Algorithms on Grid Datafarm Architecture for High-Energy Physics Applications

HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Simulation of Dynamic Data Replication Strategies in Data Grids

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing

The impact of data replication on job scheduling performance in the Data Grid

Future Generation Computer Systems
Job scheduling and data replication on data grids

Future Generation Computer Systems
An on-line replication strategy to increase availability in Data Grids

Future Generation Computer Systems
Performance of file replication policies for real-time file access in data grids

Proceedings of the first international conference on Networks for grid applications
A dynamic data replication strategy using access-weights in data grids

The Journal of Supercomputing
A study on performance of dynamic file replication algorithms for real-time file access in Data Grids

Future Generation Computer Systems
A model to predict the optimal performance of the Hierarchical Data Grid

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data replication is a common method used to improve the performance of data access in distributed systems. In this paper, two dynamic replication algorithms, Simple Bottom-Up (SBU) and Aggregate Bottom-Up (ABU), are proposed for the multitier Data Grid. A multi-tier Data Grid simulator called DRepSim is developed for studying the performances of the dynamic replication algorithms. The simulation results show that both algorithms can reduce the average response time of data access greatly compared to the static replication method. ABU can achieve great performance improvements for all access patterns even if the available storage size of the replication server is very small. Comparing the two algorithms to Fast Spread dynamic replication strategy, ABU proves to be superior. As for SBU, although the average response time of Fast Spread is better in most cases, Fast Spread's replication frequency is too high to be applicable in the real world.