Revisiting the paxos algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1320, Issue , 1997, Pages 111-125

  De Prisco, Roberto ^a   Lampson, Butler ^a   Lynch, Nancy ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Distributed consensus; Fault tolerance; Formal verification; I O automata models; Partially synchronous systems

Indexed keywords

CLOCKS; FAULT TOLERANCE; FITS AND TOLERANCES; FORMAL VERIFICATION;

AUTOMATA MODELS; CORRECTNESS PROOFS; DISTRIBUTED CONSENSUS; DISTRIBUTED SYSTEMS; FAULT TOLERANT ALGORITHMS; FAULT-TOLERANCE ANALYSIS; PERFORMANCE ANALYSIS; SYNCHRONOUS SYSTEM;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 84949216703     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030679     Document Type: Conference Paper

References (17)

1. T.D. Chandra, V. Hadzilacos, S. Toueg, The weakest failure detector for solving consensus, in Proceedings of the IIth Annual ACM Symposium on Principles of Distributed Computing, pages 147-158, Vancouver, British Columbia, Canada, August 1992.
2. T.D. Chandra, S. Toueg, Unreliable failure detector for asynchronous distributed systems, Journal of the ACM, Vol. 43 (2), pp. 225-267. A preliminary version appeared in the Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, pages 325-340, August 1991.
3. F. Cristian and C. Fetzer, The timed asynchronous system model, Dept. of Computer Science, UCSD, La Jolla, CA. Technical Report CSE97-519.
4. R. De Prisco, Revisiting the Paxos algorithm, M.S. Thesis, Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge, MA, June 1997. Technical Report MIT-LCS-TR-717, Lab. for Computer Science, MIT, Cambridge, MA, USA, June 1997.
5. C. Dwork, N. Lynch, L. Stockmeyer, Consensus in the presence of partial synchrony, J. of the ACM, vol. 35 (2), pp. 288-323, April 1988.
6. A. Fekete, N. Lynch, A. Shvartsman, Specifying and using a partitionable group communication service, to appear in Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, August 1997.
7. M.J. Fischer, The consensus problem in unreliable distributed systems (a brief survey). Rep. YALEU/DSC/RR-273. Dept. of Computer Science, Yale Univ., New Have, Conn., June 1983.
8. L. Lamport, The part-time parliament, Research Report 49, Digital Equipment Corporation Systems Research Center, Palo Alto, CA, September 1989.
9. B. Lampson, How to build a highly available system using consensus, in Proceedings of the 10th International Workshop on Distributed Algorithms WDAG 96, Bologna, Italy, pages 1-15, 1996.
10. B. Liskov, B. Oki, Viewstamped replication: A new primary copy method to support highly-available distributed systems, in Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, pages 8-17, August 1988.
11. N. Lynch, Distributed Algorithms, Morgan Kaufmann Publishers, San Francisco, 1996.
12. N. Lynch, F. Vaandrager, Forward and backward simulations for timing-based systems, in Real-Time: Theory in Practice, Vol. 600 of Lecture Notes in Computer Science, Springer-Verlag, pp. 397-446, 1992.
13. N. Lynch, F. Vaandrager, Forward and backward simulations—Part II: Timing-based systems. Technical Memo MIT-LCS-TM-487.b, Lab. for Computer Science, MIT, Cambridge, MA, USA, April 1993.
14. N. Lynch, F. Vaandrager. Actions transducers and timed automata. Technical Memo MIT-LCS-TM-480.b, Lab. for Computer Science, MIT, Cambridge, MA, USA, October 1994.
15. B. Oki, Viewstamped replication for highly-available distributed systems, Ph.D. Thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, 1988.
16. B. Patt-Shamir, A theory of clock synchronization, Ph.D. Thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, October 1994.
17. D. Skeen, Nonblocking Commit Protocols, Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 133-142, May 1981.