Published in

Springer, Lecture Notes in Computer Science, p. 75-86, 2001

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

Links

Tools

Export citation

Search in Google Scholar

Identifying Dynamic Replication Strategies for a High-Performance Data Grid

Journal article published in 2001 by Kavitha Ranganathan, Ian Foster ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Red circle
Preprint: archiving forbidden
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Dynamic replication can be used to reduce bandwidth consumption and access latency in high performance "data grids" where users require remote access to files that are large: on average, around two Gigabytes. Different replication strategies are defined depending on when, where, and how the 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 the best strategies have significant savings in latency and bandwidth if the access patterns contain a small degree of geographical locality.