Replica Placement Strategies in Data Grid

被引:47
作者
Rahman, Rashedur M. [1 ]
Barker, Ken [1 ]
Alhajj, Reda [1 ]
机构
[1] Univ Calgary, Dept Comp Sci, Calgary, AB T2N 1N4, Canada
关键词
Data Grid; Replication; Network latency; Dynamic allocation; Distributed environment;
D O I
10.1007/s10723-007-9090-8
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Replication is a technique used in Data Grid environments that helps to reduce access latency and network bandwidth utilization. Replication also increases data availability thereby enhancing system reliability. The research addresses the problem of replication in Data Grid environment by investigating a set of highly decentralized dynamic replica placement algorithms. Replica placement algorithms are based on heuristics that consider both network latency and user requests to select the best candidate sites to place replicas. Due to dynamic nature of Grid, the candidate site holds replicas currently may not be the best sites to fetch replicas in subsequent periods. Therefore, a replica maintenance algorithm is proposed to relocate replicas to different sites if the performance metric degrades significantly. The study of our replica placement algorithms is carried out using a model of the EU Data Grid Testbed 1 [Bell et al. Comput. Appl., 17(4), 2003] sites and their associated network geometry. We validate our replica placement algorithms with total file transfer times, the number of local file accesses, and the number of remote file accesses.
引用
收藏
页码:103 / 123
页数:21
相关论文
共 24 条
[1]   Data management and transfer in high-performance computational grid environments [J].
Allcock, B ;
Bester, J ;
Bresnahan, J ;
Chervenak, AL ;
Foster, I ;
Kesselman, C ;
Meder, S ;
Nefedova, V ;
Quesnel, D ;
Tuecke, S .
PARALLEL COMPUTING, 2002, 28 (05) :749-771
[2]  
ALLCOCK B, 2001, IEEE MASS STOR C
[3]  
[Anonymous], 2004, P ACM IEEE C HIGH PE, DOI DOI 10.1109/SC.2004.7
[4]  
BELL W, 2003, INT J HIGH PERFORM C, V17
[5]  
BUYYA R, 2000, NIMROD G ARCHITECTUR, P283
[6]  
Cohon J., 1978, Multiobjective programming and planning
[7]  
Daskin M. S., 1995, NETWORK DISCRETE LOC
[8]  
Drezner Z, 2002, FACILITY LOCATION APPLICATIONS AND THEORY, P1
[9]   THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS [J].
FISHER, ML .
MANAGEMENT SCIENCE, 1981, 27 (01) :1-18
[10]  
Foster I, 1999, GRID: BLUEPRINT FOR A NEW COMPUTING INFRASTRUCTURE, P259