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

Mohammad Shorfuzzaman, Peter Graham, Rasit Eskicioglu

Research output: Contribution to journalJournal articlepeer-review

3 Scopus citations

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.

Original languageEnglish
Pages (from-to)157-174
Number of pages18
JournalInternational Journal of Grid and Utility Computing
Volume3
Issue number2-3
DOIs
StatePublished - Jul 2012
Externally publishedYes

Keywords

  • Data grids
  • Distributed algorithms
  • Dynamic programming
  • Quality of service
  • Replication
  • Workload constraint

Fingerprint

Dive into the research topics of 'Allocating replicas in large-scale data grids using a QoS-aware distributed technique with workload constraints'. Together they form a unique fingerprint.

Cite this