2000 character limit reached
Different Perspectives on FLP Impossibility (2210.02695v9)
Published 6 Oct 2022 in cs.DC
Abstract: We demonstrate termination of binary consensus under the model and conditions used by Fischer, Lynch, and Patterson (FLP) to prove impossibility of binary agreement - in complete asynchrony and a possible process crash - in two steps. First, we introduce a new paradigm for consensus termination and show that impossibility of agreement is not evidence for impossibility to terminate. Next, we present a consensus algorithm that ensures termination with agreement about the initial input from the processes.
- Concurrency Control and Recovery in Database Systems. Addison-Wesley Publishing Company.
- Dany Dolev. 1981. The Byzantine generals strike again. Algorithm 3 (1981), 14–30. Issue 1, 1982.
- Impossibility of distributed consensus with one faulty process. J. ACM 32 (April 1985). Issue 2.
- Applications of Byzantine agreement in database systems. ACM Transactions on Database Systems (1986). Issue July 1986.
- Seth Gilbert and Nancy Lynch. 2012. Perspectives on the CAP theorem. Computer 45 (2012), 30–36.
- Jim Gray. 1978. Notes on Database Operating Systems, Operating Systems: An Advanced Course. In Lecture Notes in Computer Science. Springer-Verlag, 393–481.
- Jim Gray and Leslie Lamport. 2006. Consensus on transaction commit. ACM Transactions on Database Systems 31 (March 2006), 133–160. Issue 1.
- Maurice Herlihy and Jeannette Wing. 1990. Linearizability: a correctness condition for concurrent objects. In ACM Transactions on Programming Languages and Systems, Vol. 12. 463–492. Issue 3.
- Leslie Lamport. 1978. The implementation of reliable distributed multiprocess systems. Computer Networks (1978), 95–114. Issue 2.
- Butler Lampson. 1996. How to build a highly available systems using consensus. In Workshop on Distributed Algorithms (WDAG) 1996, London, UK. Springer-Verlag, 1–17.
- Butler Lampson and Howard Sturgis. 1976. Crash Recovery in a Distributed Data Storage System. (1976). Technical Report, Xerox Palo Alto Research Center.
- Notes on Distributed Databases. (1979). IBM Research Report RJ2571.
- Peter Menzies and Helen Beebee. 2001. Counterfactual Theories of Causation.
- Method for distributed transaction commit and recovery using Byzantine agreement with clusters of processors. In ACM SIGOPS Operating Systems Review 19(3). 29–43.
- Reaching agreement in the presence of faults. J. ACM 27 (April 1980). Issue 2.
- Nicola Santoro and Peter Widmayer. 1989. Time is not a healer. In 6th Symposium on Theoretical Aspects of Computer Science. 304–313.
- Fred Schneider. 1990. Implementing fault-tolerant services using the state machine approach: A tutorial. Comput. Surveys 22 (1990). Issue 4.