scispace - formally typeset
Open Access

Design and Evaluation of Dynamic Replication Strategies for a High-Performance Data Grid

TLDR
A simulation framework that is developed to model a grid scenario, which enables comparative studies of alternative dynamic replication strategies for three different kinds of access patterns, and shows that the best strategy has significant savings in latency and bandwidth consumption if the access patterns contain a moderate amount of geographical locality.
Abstract
Physics experiments that generate large amounts of data need to be able to share it with researchers around the world. High performance grids facilitate the distribution of such data to geographically remote places. Dynamic replication can be used as a technique to reduce bandwidth consumption and access latency in accessing these huge amounts of data. We describe a simulation framework that we have developed to model a grid scenario, which enables comparative studies of alternative dynamic replication strategies. We present preliminary results obtained with this simulator, in which we evaluate the performance of six different replication strategies for three different kinds of access patterns. The simulation results show that the best strategy has significant savings in latency and bandwidth consumption if the access patterns contain a moderate amount of geographical locality.

read more

Content maybe subject to copyright    Report

Citations
More filters

A dynamic replica creation: Which file to replicate?

TL;DR: Simulation results (via Optorsim) show that EXPM outperformed LALW in the measured metrics – mean job execution time, effective network usage and average storage usage.
Journal Article

Improving data grids performance by using modified dynamic hierarchical replication strategy

TL;DR: Simulation results utilizing the OptorSim show MDHR achieves better performance overall than other strategies in terms of job execution time, effective network usage and storage usage.

A Survey on Dynamic Replication Strategies for Improving Response Time in Data Grid Environment

TL;DR: Different replication algorithms are investigated to determine which attributes are assumed in a given algorithm and which are declined, and a tabular representation of important factors is provided to facilitate the future comparison of data replication algorithms.
Journal ArticleDOI

Based on the Correlation of the File Dynamic Replication Strategy in Multi-Tier Data Grid

TL;DR: A dynamic grid replication algorithm based on popularity support and confidence (BPSC) is introduced, based on the popularity of file dynamic to replicate data, and consider the storage space limitations of the site, which can provide better performance compared with other algorithms.
Journal ArticleDOI

A GA-Based Replica Placement Mechanism for Data Grid

TL;DR: A GA-Based Replica Placement Mechanism (DBRPM) is proposed that finds the best locations to store replicas based on five criteria, namely, 1) Read Cost, 2) Storage Cost, 3) Sites' Workload, and 4) Replication Site.
References
More filters
Journal ArticleDOI

The Anatomy of the Grid: Enabling Scalable Virtual Organizations

TL;DR: The authors present an extensible and open Grid architecture, in which protocols, services, application programming interfaces, and software development kits are categorized according to their roles in enabling resource sharing.
Posted Content

The Anatomy of the Grid - Enabling Scalable Virtual Organizations

TL;DR: This article reviews the "Grid problem," and presents an extensible and open Grid architecture, in which protocols, services, application programming interfaces, and software development kits are categorized according to their roles in enabling resource sharing.
Journal ArticleDOI

Summary cache: a scalable wide-area web cache sharing protocol

TL;DR: This paper demonstrates the benefits of cache sharing, measures the overhead of the existing protocols, and proposes a new protocol called "summary cache", which reduces the number of intercache protocol messages, reduces the bandwidth consumption, and eliminates 30% to 95% of the protocol CPU overhead, all while maintaining almost the same cache hit ratios as ICP.
Journal ArticleDOI

The data grid

TL;DR: In this paper, the authors introduce design principles for a data management architecture called the data grid, and describe two basic services that are fundamental to the design of a data grid: storage systems and metadata management.
Proceedings ArticleDOI

Summary cache: a scalable wide-area Web cache sharing protocol

TL;DR: This paper proposes a new protocol called "Summary Cache"; each proxy keeps a summary of the URLs of cached documents of each participating proxy and checks these summaries for potential hits before sending any queries, which enables cache sharing among a large number of proxies.
Related Papers (5)