Identifying Dynamic Replication Strategies for a High-Performance Data Grid

  • Kavitha Ranganathan
  • Ian Foster
Conference paper

DOI: 10.1007/3-540-45644-9_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2242)
Cite this paper as:
Ranganathan K., Foster I. (2001) Identifying Dynamic Replication Strategies for a High-Performance Data Grid. In: Lee C.A. (eds) Grid Computing — GRID 2001. GRID 2001. Lecture Notes in Computer Science, vol 2242. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Kavitha Ranganathan
    • 1
  • Ian Foster
    • 1
  1. 1.Department of Computer ScienceThe University of ChicagoChicago

Personalised recommendations