Grid Computing — GRID 2001

Volume 2242 of the series Lecture Notes in Computer Science pp 75-86


Identifying Dynamic Replication Strategies for a High-Performance Data Grid

  • Kavitha RanganathanAffiliated withDepartment of Computer Science, The University of Chicago
  • , Ian FosterAffiliated withDepartment of Computer Science, The University of Chicago

* Final gross prices may vary according to local VAT.

Get Access


Dynamic replication can be used to reduce bandwidth consumption and access latency in high performance “data grids” where users require remote access to large files. Different replication strategies can be defined depending on when, where, and how replicas are created and destroyed. We describe a simulation framework that we have developed to enable comparative studies of alternative dynamic replication strategies. We present preliminary results obtained with this simulator, in which we evaluate the performance of five different replication strategies for three different kinds of access patterns. The data in this scenario is read-only and so there are no consistency issues involved. The simulation results show that significant savings in latency and bandwidth can be obtained if the access patterns contain a small degree of geographical locality.