Dynamic replication in a data grid using a Modified BHR Region Based Algorithm
Dynamic replication in a data grid using a Modified BHR Region Based Algorithm
复制标题
DOI：
10.1016/j.future.2010.08.011
复制
发表时间：
2011-02
期刊：
影响因子：
--
通讯作者：
K. Sashi;Antony Selvadoss Thanamani
中科院分区：
文献类型：
--
作者：
K. Sashi;Antony Selvadoss Thanamani
网格计算正在成为科学和工程领域广泛学科基础设施的关键部分，包括天文学、高能物理、分子生物学和地球科学。这些应用程序处理需要在不同网格站点之间传输和复制的大型数据集。数据网格处理科学和企业计算中的数据密集型应用程序。开发数据网格技术是为了允许地理上分散的多个组织之间共享数据。将数据复制到不同的站点将有助于世界各地的研究人员分析和启动未来的实验。复制的一般思想是将数据的副本存储在不同的位置，以便在一个位置的副本丢失或不可用时可以轻松恢复数据。在大规模数据网格中，复制为数据文件的管理提供了合适的解决方案，提高了数据的可靠性和可用性。针对标准BHR算法的局限性，提出了一种改进的BHR算法。该算法使用由欧洲数据网格项目开发的数据网格模拟器OptorSim进行了模拟。该算法通过最小化数据访问时间和避免不必要的复制来提高算法的性能。
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.