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 Data Grid File Replication Maintenance Strategy Using Bayesian Networks
TL;DR: A dynamic replication maintenance service for maintaining data in grid environments using Bayesian Networks and a maintenance strategy called Implicit Dynamic Maintenance Service with Bayesian Network (IDMSBN).
Journal ArticleDOI
Minimizing data access latency in data grids by neighborhood‐based data replication and job scheduling
TL;DR: Two new neighborhood‐based job scheduling strategies and a novel neighborhood-based dynamic data replication algorithm (NDDR) are proposed that reduce the access latency by considering a variety of practical parameters for decision making and the access delay by considering the failure probability of a node in job scheduling, replica selection, and replica placement.
Proceedings ArticleDOI
PPRA: A new pre-fetching and prediction based replication algorithm in data grid
TL;DR: A new dynamic replication algorithm called pre-fetching and prediction based replication algorithm (PPRA) is put forward, which can give better average job execution time and bandwidth consumption as compared with NoRep, LRU, LFU, BHR and Modified BHR algorithms.
Proceedings ArticleDOI
Optimized Strategies of Grid Information Services
TL;DR: This paper puts forward the strategies of ring replication and Thread replication, both of which are really better ways to raise the efficiency of the grid information service system compared with many other replication strategies.
Implementation of Sub-Grid-Federation Model for Performance Improvement in Federated Data Grid
Zarina Mohamad,Fadhilah Ahmad,Ahmad Nazari Mohd Rose,Fatma Susilawati Mohamad,Mustafa Mat Deris +4 more
TL;DR: The results indicate that the Sub-Grid-Federation is a better alternative for the implementation of collaboration and data sharing in data grid system.
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.