QoS-Aware, Access-Efficient and Storage-Efficient Replica Placement in Grid Environments
Journal
The Journal of Supercomputing
Journal Volume
49
Journal Issue
1
Pages
42-63
Date Issued
2008
Date
2008
Author(s)
Abstract
In this paper, we study the quality-of-service (QoS)-aware replica placement problem in grid environments. Although there has been much work on the replica placement problem in parallel and distributed systems, most of them concern average system performance and have not addressed the important issue of quality of service requirement. In the very few existing work that takes QoS into consideration, a simplified replication model is assumed; therefore, their solution may not be applicable to real systems. In this paper, we propose a more realistic model for replica placement, which consider storage cost, update cost, and access cost of data replication, and also assumes that the capacity of each replica server is bounded. The QoS-aware replica placement is NP-complete even in the simple model. We propose two heuristic algorithms, called greedy remove and greedy add to approximate the optimal solution. Our extensive experiment results demonstrate that both greedy remove and greedy add find a near-optimal solution effectively and efficiently. Our algorithms can also adapt to various parallel and distributed environments. © 2008 Springer Science+Business Media, LLC.
Subjects
Data grids; Greedy heuristics; Replica placement
SDGs
Other Subjects
Access cost; Average system; Data grids; Data replication; Distributed environments; Greedy heuristics; Grid environments; Near-optimal solutions; NP Complete; Optimal solutions; Parallel and distributed systems; Real systems; Realistic model; Replica placement; Replica placement problems; Replica servers; Replication models; Simple model; Storage costs; Grid computing; Heuristic methods; Optimal systems; Parallel algorithms; Quality of service; Heuristic algorithms
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
14.pdf
Size
559.02 KB
Format
Adobe PDF
Checksum
(MD5):da01f2c67424a1e4eb7c855a0011ec22