.png){kind=icon}
Return
Dynamic replication in a data grid using a Modified BHR Region Based Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2010.08.011.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Grid computing is emerging as a key part of the infrastructure for a wide range of disciplines in science and engineering including astronomy high energy physics molecular biology and earth sciences These applications handle large data sets that need to be transferred and replicated among different grid sites A data grid deals with data intensive applications in scientific and enterprise computing Data grid technology is developed to permit data sharing across many organizations in geographically disperse locations Replication of data to different sites will help researchers around the world analyse and initiate future experiments The general idea of replication is to store copies of data in different locations so that data can be easily recovered if a copy at one location is lost or unavailable In a large-scale data grid replication provides a suitable solution for managing data files which enhances data reliability and availability In this paper a Modified BHR algorithm is proposed to overcome the limitations of the standard BHR algorithm The algorithm is simulated using a data grid simulator OptorSim developed by European Data Grid projects The performance of the proposed algorithm is improved by minimizing the data access time and avoiding unnecessary replication (C) 2010 Elsevier B V All rights reserved
Keywords:
Grid computing
Data grid
Static replication
Dynamic replication
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
F
IF:
6.1
Papers:
6.8K
Citations:
2.3W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave no more
no more