Allocating replicas in large-scale data grids using a QoS-aware distributed technique with workload constraints. (1st January 2012)

• Record Type: Journal Article
• Authors: Shorfuzzaman, Mohammad; Graham, Peter; Eskicioglu, Rasit
• Is Part Of: International journal of grid and utility computing. Volume 3:Number 2/3(2012)
• Page Start: 157
• Page End: 174
• Publication Date: 2012-01-01
• Subjects: data grids -- replication -- quality of service -- distributed algorithms -- dynamic programming -- workload constraint; Electronic data processing -- Distributed processing -- Periodicals; Electronic commerce -- Management -- Computer programs -- Periodicals; 004.605
• Languages: English
• ISSNs: 1741-847X

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.