[ 1 ] LAMPSON B W. How to build a highly available system using consensus[C]//International Workshop on Distributed Algorithms. Springer-Verlag, 1996: 1-17.
[ 2 ] GILBERT S, LYNCH N©Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services [J]. Acm Sigact News, 2002, 33(2): 51-59.
[ 3 ] BREWER E A. Towards robust distributed systems (abstract) [C]//Nineteenth ACM Symposium on Principles of Distributed Computing. ACM, 2007: 7.
[ 4 ] GRAY J N. Notes on data base operating systems[C]//Advanced Course: Operating Systems. Springer-Verlag, 1978: 393-481.
[ 5 ] MOHAN C, LINDSAY B, OBERMARCK R. Transaction management in the R* distributed database management system[J]. ACM Transactions on Database Systems, 1986, 11(4): 378-396.
[ 6 ] LAMPSON B W, LOMET D B. A New Presumed Commit Optimization for Two Phase Commit[C]//International Conference on Very Large Data Bases. Morgan Kaufmann Publishers Inc, 1993: 630-640.
[ 7 ] LAMPORT L. Paxos made simple[J]. AcmSigact News, 2001, 32(4): 1-11.
[ 8 ] CHANDRA T D, GRIESEMER R, REDSTONE J. Paxos made live: An engineering perspective[C]//Twenty-Sixth ACM Symposium on Principles of Distributed Computing. ACM, 2007: 398-407.
[ 9 ] LAMPORT L. The part-time parliament[J]. Acm Transactions on Computer Systems, 1998, 16(2): 133-169.
[10] SKEEN D. Nonblocking commit protocols[C]//ACM SIGMOD International Conference on Management of Data, Ann Arbor, Michigan, April 29-May. 1981: 133-142.
[11] GIFFORD D K. Weighted voting for replicated data[C]//ACM Symposium on Operating Systems Principles. ACM, 1979: 150-162.
[12] LAMPORT L B, MASSA M T. Cheap paxos: IEEE, US 7249280 B2 [P]. 2007.
[13] LAMPORT L. Fast Paxos [J]. Distributed Computing, 2005, 19(2): 79-103.
[14] LAMPORT L, MALKHI D, ZHOU L, et al. Vertical paxos and primary-backup replication[C]//Principles of Distributed Computing, 2009: 312-313.
[15] ONGARO D, OUSTERHOUT J. In search of an understandable consensus algorithm [R/OL]. [2016-07-07]. https://ramcloud.atlassian.net/wiki/download/attachments/6586375/raft.pdf
[16] COULOURIS G, DOLLIMORE J, KINDBERG Tet al. Distrinbuted Systems Concepts and Design[M]. 5 版.北京: 机械工业出版社, 2015: 378-380.
[17] GRAY J. The dangers of replication and a solution [J]. AcmSigmod Record, 1996, 25(2): 173-182.
[18] CORBETT J C, DEAN J, EPSTEIN M P, et al. Spanner: Google's globally-distributed database[C]. Operating Systems Design and Implementation, 2012: 251-264.
[19]阳振坤. OceanBase 关系数据库架构 [J]. 华东师范大学学报(自然科学版),2014(5): 141-148.
[20]李凯, 韩富晟. OceanBase 内存事务引擎 [J].华东师范大学学报(自然科学版), 2014(5): 149-163.
[21] 杨传辉. OceanBase高可用方案 [J]. 华东师范大学学报(自然科学版),2014(5): 173-179.
[22]张晨东, 郭进伟, 刘柏众, 等. 基于Raft一致性协议的高可用性实现 [J].华东师范大学学报(自然科学版), 2015(5): 172-184.
[23]庞天泽.可扩展数据管理系统中的高可用性实现[D].上海:华东师范大学计算机科学与软件工程学院. 2016.
[24] LAMPORT L, SHOSTAK R, PEASE M. The byzantine generals problem [J]. Acm Transactions on Programming Languages {\&] Systems, 1995, 4(3): 382-401.
[25] GRAY J, LAMPORT L. Consensus on transaction commit [J]. Acm Transactions on Database Systems, 2010, 31(1): 133-160. |