The Journal of Supercomputing

, Volume 49, Issue 1, pp 42-63

First online:

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

  • Chieh-Wen ChengAffiliated withDepartment of Computer Science and Information Engineering, National Taiwan University
  • , Jan-Jan WuAffiliated withInstitute of Information Science, Academia Sinica Email author 
  • , Pangfeng LiuAffiliated withDepartment of Computer Science and Information Engineering, National Taiwan UniversityGraduated Institute of Networking and Multimedia, National Taiwan University

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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