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
Citations
More filters
Proceedings ArticleDOI
A dynamic file replication strategy in data grids
TL;DR: The contributions of this paper are that the data grid environment will be more efficiency by using DMS algorithm and the experimental results show that the D MS algorithm is more efficient than other replication strategies.
Journal ArticleDOI
A new decentralized periodic replication strategy for dynamic data grids
TL;DR: A new decentralized periodic replication strategy for dynamic data grids assuming limited storage for replicas, called DPRSKP, which stands for Decentralized Periodic Replication Strategy based on Knapsack problem, based on two polynomial-time complexity algorithms.
Journal ArticleDOI
Mathematical Framework for A Novel Database Replication Algorithm
TL;DR: PDDRA (Pre-fetching based dynamic data replication algorithm) algorithm as recently published is detailed and a mathematical framework is presented to evaluate mean waiting time before a data can be replicated on the requested site.
Dissertation
Replica Creation Algorithm for Data Grids
TL;DR: This research contributes replication strategies embodied in one algorithm that enhances data grid performance, capable of making a decision on creating or deleting more than one file during same decision, to give an accurate file evaluation.
Journal ArticleDOI
Replica Placement Strategy for Data Grid Environment
TL;DR: A replica placement strategy RPS is proposed that finds the best locations to store replicas based on four criteria, namely, 1 Read Cost, 2 File Transfer Time, 3 Sites' Workload, and 4 Replication Sites, and results show that RPS requires less execution time and consumes less network usage.
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.