Allocating replicas in large-scale data grids using a QoS-aware distributed technique with workload constraints

Authors:
Mohammad Shorfuzzaman;Peter Graham;Rasit Eskicioglu
Affiliations:
Department of Computer Science, University of Manitoba, Winnipeg, MB R3T 2N2, Canada.;Department of Computer Science, University of Manitoba, Winnipeg, MB R3T 2N2, Canada.;Department of Computer Science, University of Manitoba, Winnipeg, MB R3T 2N2, Canada
Venue:
International Journal of Grid and Utility Computing
Year:
2012

Citing 18
Cited 0

The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs

IEEE Transactions on Parallel and Distributed Systems
High-performance remote access to climate simulation data: a challenge problem for data grid technologies

Proceedings of the 2001 ACM/IEEE conference on Supercomputing
The Astrophysics Simulation Collaboratory: A Science Portal Enabling Community Software Development

Cluster Computing
Data management and transfer in high-performance computational grid environments

Parallel Computing - Parallel data-intensive algorithms and applications
Simulation of Dynamic Grid Replication Strategies in OptorSim

GRID '02 Proceedings of the Third International Workshop on Grid Computing
Identifying Dynamic Replication Strategies for a High-Performance Data Grid

GRID '01 Proceedings of the Second International Workshop on Grid Computing
Giggle: a framework for constructing scalable replica location services

Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Secure, Efficient Data Transport and Replica Management for High-Performance Data-Intensive Computing

MSS '01 Proceedings of the Eighteenth IEEE Symposium on Mass Storage Systems and Technologies
Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities

CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Data Replication Strategies in Grid Environments

ICA3PP '02 Proceedings of the Fifth International Conference on Algorithms and Architectures for Parallel Processing
QoS-Aware Replica Placement for Content Distribution

IEEE Transactions on Parallel and Distributed Systems
A taxonomy of Data Grids for distributed data sharing, management, and processing

ACM Computing Surveys (CSUR)
Optimal Placement of Replicas in Data Grid Environments with Locality Assurance

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Optimal replica placement in hierarchical Data Grids with locality assurance

Journal of Parallel and Distributed Computing
A QoS-Aware Heuristic Algorithm for Replica Placement

GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
QoS-aware, access-efficient, and storage-efficient replica placement in grid environments

The Journal of Supercomputing
QoS-Aware Distributed Replica Placement in Hierarchical Data Grids

AINA '11 Proceedings of the 2011 IEEE International Conference on Advanced Information Networking and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

An important technique to speed access in data grids is replication, which provides nearby replicas. In a data grid environment, resource availability, network latency and user request patterns may change. In this paper, we introduce a new distributed replica placement algorithm for hierarchical data grids that determines the positions of a minimum number of replicas expected to satisfy certain quality requirements. Our placement algorithm computes replica locations by minimising overall replication cost (read and update) while maximising Quality of Service (QoS) satisfaction for a given traffic pattern. Our algorithm also assumes that the workload capacity of each replica server is bounded. The problem is formulated using dynamic programming. We assess our algorithm using OptorSim. A comparison of our algorithm to its QoS-unconstrained counterpart and to two other existing algorithms (Greedy Add and Greedy Remove) shows that our algorithm can shorten job execution time significantly while requiring only moderate network bandwidth.