The Journal of Supercomputing

, Volume 49, Issue 1, pp 42–63

QoS-aware, access-efficient, and storage-efficient replica placement in grid environments


DOI: 10.1007/s11227-008-0221-1

Cite this article as:
Cheng, CW., Wu, JJ. & Liu, P. J Supercomput (2009) 49: 42. doi:10.1007/s11227-008-0221-1


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.


Replica placement Data grids Greedy heuristics 

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.Department of Computer Science and Information EngineeringNational Taiwan UniversityTaipeiTaiwan
  2. 2.Graduated Institute of Networking and MultimediaNational Taiwan UniversityTaipeiTaiwan
  3. 3.Institute of Information ScienceAcademia SinicaTaipeiTaiwan

Personalised recommendations