[1] Asplund M, Nadjm-Tehrani S. Post-partition reconciliation protocols for maintaining consistency[C]//Proceedings of the 21st ACM/SIGAPP Symposium on Applied Computing. New York, NY, USA, April 2006.[2] Zhou X, Lu X L, Hou M S, et al. A dynamic distributed replica management mechanism based on accessing frequency detecting[J]. SIGOPS Oper Syst Rev, 2004, 38(3): 26-34.[3] Chang R, Chang J. Adaptable replica consistency service for data grid[C]//Third International Conference on Information Technology: New Generations(ITNG'06). 2006.[4] Cao D M. The research of replica selection and consistency for grid . Wuhan: Huazhong University of Science and Technology, 2007 (in Chinese). 曹冬梅. 基于网格环境的副本选择与一致性研究 . 武汉: 华中科技大学, 2007.[5] Kraska T, Hentschel M, Alonso G, et al. Consistency rationing in the cloud: pay only when it matters[J]. Proceedings of the VLDB Endowment, 2009, 2(1): 253-264.[6] Yu H F, Amin V. Design and evaluation of a conit-based continuous consistency model for replicated services[J]. ACM Transactions on Computer Systems,2002,20(3): 239-282.[7] Asplund M, Nadjm-Tehrani S. Formalising reconciliation in partitionable networks with distributed services[C]//Butler M, et al. (Eds) Rigorous Development of Complex Fault-tolerant Systems (Lecture Notes in Computer Science, Vol. 4157). Springer: Berlin, 2006: 37-58.[8] Beyer S, Ruiz-Fuertes M I, Galdamez P, et al. Exploiting commutativity for efficient replication in partitionable distributed systems[C]//Proceedings of the 2007 OTM Confederated International Conference on the Move to Meaningful Internet sSstems-Volume Part II. Vilamoura, Portugal, Springer-Verlag, 2007.[9] Gilbert S, Lynch N. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services[J]. ACM,2002, 33: 51-59. |