DocumentCode :
2647070
Title :
A New Dynamic Replication Algorithm for Hierarchy Networks in Data Grid
Author :
Mansouri, N. ; Dastghaibyfard, Gh
Author_Institution :
Dept. of Comput. Sci. & Eng., Shiraz Univ., Shiraz, Iran
fYear :
2011
fDate :
26-28 Oct. 2011
Firstpage :
187
Lastpage :
192
Abstract :
Data grid provides massive aggregated computing resources and distributed storage space to deal with data-intensive applications. Due to limitation of available resources in grid as well as production the large number of workloads, efficient use of the grid resources becomes important challenge. Replication provides decreased bandwidth consumption, improved fault tolerance, and enhanced scalability. Although replication is a key technique, but the problem of selecting proper locations for placing replicas i.e. best replica placement in Data Grid has not been widely studied, yet. In this paper a modified 3-layer hierarchical replication algorithm is proposed for dynamic creation of replicas, replica selection and especially replica placement which selects best location. The simulation and experiment results show the proposed replication strategy outperforms over current strategies about 14%.
Keywords :
grid computing; 3-layer hierarchical replication algorithm; data grid; data-intensive applications; dynamic replication algorithm; grid resources; hierarchy networks; replica placement; Bandwidth; Data models; Distributed databases; Heuristic algorithms; Local area networks; Processor scheduling; Scheduling; Data Grid; Replication; Simulation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), 2011 International Conference on
Conference_Location :
Barcelona
Print_ISBN :
978-1-4577-1448-1
Type :
conf
DOI :
10.1109/3PGCIC.2011.36
Filename :
6103157
Link To Document :
بازگشت