Efficient Dynamic Replication Algorithm Using Agent for Data Grid
In data grids scientific and business applications produce huge volume of data which needs to be transferred among the distributed and heterogeneous nodes of data grids. Data replication provides a solution for managing data files efficiently in large grids. The data replication helps in enhancing t...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/767016 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832548479150325760 |
|---|---|
| author | Priyanka Vashisht Rajesh Kumar Anju Sharma |
| author_facet | Priyanka Vashisht Rajesh Kumar Anju Sharma |
| author_sort | Priyanka Vashisht |
| collection | DOAJ |
| description | In data grids scientific and business applications produce huge volume of data which needs to be transferred among the distributed and heterogeneous nodes of data grids. Data replication provides a solution for managing data files efficiently in large grids. The data replication helps in enhancing the data availability which reduces the overall access time of the file. In this paper an algorithm, namely, EDRA using agents for data grid, has been proposed and implemented. EDRA consists of dynamic replication of hierarchical structure taken into account for the selection of best replica. Decision for selecting the best replica is based on scheduling parameters. The scheduling parameters are bandwidth, load gauge, and computing capacity of the node. The scheduling in data grid helps in reducing the data access time. The distribution of the load on the nodes of data grid is done evenly by considering scheduling parameters. EDRA is implemented using data grid simulator, namely, OptorSim. European Data Grid CMS test bed topology is used in this experiment. The simulation results are obtained by comparing BHR, LRU, No Replication, and EDRA. The result shows the efficiency of EDRA algorithm in terms of mean job execution time, network usage, and storage usage of node. |
| format | Article |
| id | doaj-art-953a0c70c5f84c90a21da322d5e9b7ba |
| institution | Kabale University |
| issn | 2356-6140 1537-744X |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | The Scientific World Journal |
| spelling | doaj-art-953a0c70c5f84c90a21da322d5e9b7ba2025-02-03T06:13:58ZengWileyThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/767016767016Efficient Dynamic Replication Algorithm Using Agent for Data GridPriyanka Vashisht0Rajesh Kumar1Anju Sharma2Department of Computer Science and Engineering, Amity School of Engineering and Technology, Bijwasan, New Delhi 110061, IndiaSchool of Mathematics and Computer Applications, Thapar University, Patiala 147004, IndiaSchool of Mathematics and Computer Applications, Thapar University, Patiala 147004, IndiaIn data grids scientific and business applications produce huge volume of data which needs to be transferred among the distributed and heterogeneous nodes of data grids. Data replication provides a solution for managing data files efficiently in large grids. The data replication helps in enhancing the data availability which reduces the overall access time of the file. In this paper an algorithm, namely, EDRA using agents for data grid, has been proposed and implemented. EDRA consists of dynamic replication of hierarchical structure taken into account for the selection of best replica. Decision for selecting the best replica is based on scheduling parameters. The scheduling parameters are bandwidth, load gauge, and computing capacity of the node. The scheduling in data grid helps in reducing the data access time. The distribution of the load on the nodes of data grid is done evenly by considering scheduling parameters. EDRA is implemented using data grid simulator, namely, OptorSim. European Data Grid CMS test bed topology is used in this experiment. The simulation results are obtained by comparing BHR, LRU, No Replication, and EDRA. The result shows the efficiency of EDRA algorithm in terms of mean job execution time, network usage, and storage usage of node.http://dx.doi.org/10.1155/2014/767016 |
| spellingShingle | Priyanka Vashisht Rajesh Kumar Anju Sharma Efficient Dynamic Replication Algorithm Using Agent for Data Grid The Scientific World Journal |
| title | Efficient Dynamic Replication Algorithm Using Agent for Data Grid |
| title_full | Efficient Dynamic Replication Algorithm Using Agent for Data Grid |
| title_fullStr | Efficient Dynamic Replication Algorithm Using Agent for Data Grid |
| title_full_unstemmed | Efficient Dynamic Replication Algorithm Using Agent for Data Grid |
| title_short | Efficient Dynamic Replication Algorithm Using Agent for Data Grid |
| title_sort | efficient dynamic replication algorithm using agent for data grid |
| url | http://dx.doi.org/10.1155/2014/767016 |
| work_keys_str_mv | AT priyankavashisht efficientdynamicreplicationalgorithmusingagentfordatagrid AT rajeshkumar efficientdynamicreplicationalgorithmusingagentfordatagrid AT anjusharma efficientdynamicreplicationalgorithmusingagentfordatagrid |