Effective Dynamic Replica Maintenance Algorithm for the Grid Environment

  • Rashedur M. Rahman
  • Ken Barker
  • Reda Alhajj
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3947)


Replication in Data Grid reduces access latency and bandwidth consumption by creating multiple data copies. One of the challenges in data replication is to select the candidate sites where replicas should be placed, which is known as the allocation problem. One performance metric to determine the best place to host replicas is select for optimum average response time. We use the p-median model for the replica placement problem. The p-median model has been exploited in urban planning to find locations where new facilities should be built. In our problem, the p-median model finds the locations of p candidate sites to place a replica that optimize the aggregated response time. Motivated by the fact that the Grid environment is highly dynamic, we propose a dynamic replica maintenance algorithm that re-allocates replicas to new candidate sites when a performance metric degrades significantly. Simulation results demonstrate that the dynamic maintenance algorithm with static placement decisions performs best in dynamic environments like Data Grids.


Data Grid Grid Environment Average Response Time Replication Strategy Candidate Site 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bell, W., et al.: OptorSim- A Grid Simulator for Studying Dynamic Data Replication Strategies. Journal of High Performance Computing Applications 17(4) (2003)Google Scholar
  2. 2.
    Buyya, R., Abramson, D., Giddy, J.: Nimrod/G: An Architecture of a Resource Management and Scheduling System in a Global Computational Grid. In: Proc. of HPC Asia, Beijing, China, pp. 283–289 (2000)Google Scholar
  3. 3.
    Chervenak, A., et al.: The Data Grid: To wards and Architecture for the Distributed Management and Analysis of Large Scientific Data Sets. Journal of Network and Computer Applications 23(3), 187–200 (2000)CrossRefGoogle Scholar
  4. 4.
    Daskin, M.S.: Network and Discrete Location Models: Algorithms and Applications. John Wiley & Sons, Chichester (1995)CrossRefMATHGoogle Scholar
  5. 5.
    Drezner, Z., Hamacher, H.W.: Facility Location Applications and Theory. Springer, Berlin (2002)CrossRefMATHGoogle Scholar
  6. 6.
    Fisher, M.L.: The Lagrangian relaxation method for solving integer programming problems. Management Science 27, 1–18Google Scholar
  7. 7.
    Foster, I.: Internet Computing and the Emerging Grid, Nature Web Matters (2000)Google Scholar
  8. 8.
    Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. J. Supercomputer Applications 5(3) (2001)Google Scholar
  9. 9.
    Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing InfrastructureGoogle Scholar
  10. 10.
    Hakami, S.: Optimum location of switching centers and the absolute centers and medians of a graph. Operations Research 12, 450–459Google Scholar
  11. 11.
    Kavitha, R., Iamnitchi, A., Foster, I.: Improving Data Availability through Dynamic Model Driven Replication in Large Peer-to-Peer Communities. In: Proc. of Global and Peer-to-Peer Computing on Large Scale Distributed Systems Workshop, Berlin (2002)Google Scholar
  12. 12.
    Kavitha, R., Foster, I.: Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications. In: Proceedings of IEEE International Symposium on High Performance Distributed Computing, Edinburgh, Scotland (July 2002)Google Scholar
  13. 13.
    Kavitha, R., Foster, I.: Design and Evaluation of Replication Strategies for a High Performance Data Grid. In: Computing and High Energy and Nuclear Physics 2001 (2001)Google Scholar
  14. 14.
    Rahman, R.M., Barker, K., Alhajj, R.: Replica Placement on Data Grid: Considering Utility and Risk. In: Proc. of IEEE Intrn’l. Conf. on Coding and Computing (2005)Google Scholar
  15. 15.
    Toregas, C., et al.: The location of emergency service facilities. Operations Research 19, 1363–1373Google Scholar
  16. 16.
    Wesolowsky, G.O., Truscott, W.G.: The multiperiod location-allocation problem with relocation of facilities. Management Science 22 (September 1975)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Rashedur M. Rahman
    • 1
  • Ken Barker
    • 1
  • Reda Alhajj
    • 1
    • 2
  1. 1.Department of Computer ScienceUniversity of CalgaryCalgaryCanada
  2. 2.Department of Computer ScienceGlobal UniversityBeirutLebanon

Personalised recommendations