Abstract
Data replication introduces well-known consistency issues. For massive data, how to improve update propagation and how to minimizing space overhead effectually are important. An optimistic replication algorithm is proposed. In our algorithm, home replica is used to resolve updates conflict and pair-wise communication supports the reconciliation of any two replicas. A new anti-entropy partner selection method based on the distribution of updates and the information of local write-log is presented. The algorithm uses write-log truncation appropriately during updates propagation to remove out-of-date updates in time. The simulation results show that the partner selection mechanism can achieve good scalability and adaptability, the average number of updates in write-log does not exceed the number of replicas, and the variety for running different numbers of updates is not obvious.
This work is supported by the National Grand Fundamental Research 973 Program of China (No.2002CB312105), A Foundation for the Author of National Excellent Doctoral Dissertation of PR China (No.200141), and the National Natural Science Foundation of China (No.69903011).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lamehamedi, H., Szymanski, B., shentu, Z., Deelman, E.: Data Replication Strategies in Grid Environments. In: Proc. Of the Fifth International Conference on Algorithms and Architectures for Parallel Processing ICA3PP 2002 (2002)
Carman, M., Zini, F., Serafini, L., Stockinger, K.: Towards an Economy-Based Optimisation of File Access and Replication on a Data Grid. In: Workshop on Agent based Cluster and Grid Computing at Int. Symposium on Cluster Computing and the Grid, CCGrid 2002, Berlin, Germany, May 2002. IEEE-CS Press, Los Alamitos (2002)
Adya, A., Bolosky, W., Castro, M., Cermak, G., Chaiken, R., Douceur, J., Howell, J., Lorch, J., Theimer, M., Wattenhofer, R.: FARSITE: Federated Available and Reliable Storage for Incompletely Trusted Environments. In: 5th Symp on Operating Systems Design and Impl. (December 2002)
Kubiatowicz, J., et al: Oceanstore: An Architecture for Global-scale Persistent Storage. In: Proc. of ASPLOS 2000. ACM, New York (2000)
Terry, D.B., Theimer, M.M., Petersen, K., et al.: Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System. In: 15th ACM Symposium on Operating Systems Principles, December 1995, pp. 172–183. ACM Press, New York (1995)
Petersen, K., Spreitzer, M.J., Terry, D.B., et al.: Flexible Update Propagation for Weakly Consistent Replication. In: 16th ACM Symposium on Operating Systems Principles, October 1997, pp. 288–301. ACM Press, New York (1997)
Bell, W.H., Cameron, D.G., Capozza, L., Millar, P., Stockinger, K., Zini, F.: Optorsim - a Grid Simulator for Studying Dynamic Data Replication Strategies. International Journal of High Performance Computing Applications 17(4) (2003)
Bell, W.H., Cameron, D.G., Capozza, L., Millar, P., Stockinger, K., Zini, F.: Design of a Replica Optimisation Framework. TechnicalReport DataGrid-02-TED- 021215, CERN, Geneva, Switzerland (December 2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, J., Wang, Y., Li, S. (2005). An Optimistic Replication Algorithm to Improve Consistency for Massive Data. In: Zhuge, H., Fox, G.C. (eds) Grid and Cooperative Computing - GCC 2005. GCC 2005. Lecture Notes in Computer Science, vol 3795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590354_88
Download citation
DOI: https://doi.org/10.1007/11590354_88
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30510-1
Online ISBN: 978-3-540-32277-1
eBook Packages: Computer ScienceComputer Science (R0)