A new dynamic replication algorithm for European data grid

  • Authors:
  • K. Sashi;Antony Selvadoss Thanamani

  • Affiliations:
  • SNR Sons College, Coimbatore;NGM College, Pollachi

  • Venue:
  • Proceedings of the Third Annual ACM Bangalore Conference
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The term grid computing refers to the emerging computational and networking infrastructure that is designed to provide pervasive and reliable access to data and computational resources over wide area network, across organizational domains. Grid computing has the potential to support different kinds of applications such as high energy physics, climate simulation astronomy and earth sciences. These applications handle large data sets that need to be used among different grid sites. Data Grids support data-intensive applications in wide area grid systems. To speed up data access, data grid systems replicate data in multiple locations so a user can access the data from a nearby site. The motivation of replication is that replication can improve data availability, data access performance, and load balancing. In this paper a new Dynamic Replication Algorithm (DRA) is proposed. DRA improves data availability by replicating files to different locations within the cluster, where a cluster is a network topological space where the sites are located closely and by storing the replica in the most popular site. Data access performance is increased by minimizing the job execution time and minimizing the network usage. It is implemented by using a data grid simulator, OptorSim Developed by European Data Grid projects.