Massive Data Oriented Replication Algorithms for Consistency Maintenance in Data Grids
暂无分享,去创建一个
Based on the Grid Community (GC) for data usage, differentiated replication algorithms are proposed, by which the replica node is selected according to key replica node (SHN) and the other. First, The replicas are passed into SHN; second, if certain nodes in a GC often access the data resource, it or its nearby nodes become an optional replica node based on the storage and bandwidth. A consistency maintenance algorithm is presented to facilitate the coherence function in a differentiated manner: a pessimistic manner or an optimistic manner, and to update according to the context. The simulation results show that the differentiated mechanism can improve grid access performance.
[1] Peter Reiher,et al. Perspectives on optimistically replicated, peer‐to‐peer filing , 1998 .
[2] David J. DeWitt,et al. X-Diff: an effective change detection algorithm for XML documents , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).
[3] Kurt Stockinger,et al. OptorSim-A Grid Simulator for Studying Dynamic Data Replication Strategies , 2003 .