Optimistically Terminating Consensus: All Asynchronous Consensus Protocols in One Framework
Author:
- Piotr ZielinskiPZPiotr Zielinski
- 1 July 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Lower bounds for asynchronous consensusDistributed Computing, 2006
- Deconstructing paxosACM SIGACT News, 2003
- Practical byzantine fault tolerance and proactive recoveryACM Transactions on Computer Systems, 2002
- A versatile family of consensus protocols based on Chandra-Toueg's unreliable failure detectorsIEEE Transactions on Computers, 2002
- A simple and fast asynchronous consensus protocol based on a weak failure detectorDistributed Computing, 1999
- Early consensus in an asynchronous system with a weak failure detectorDistributed Computing, 1997
- The weakest failure detector for solving consensusJournal of the ACM, 1996
- Unreliable failure detectors for reliable distributed systemsJournal of the ACM, 1996
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- FORTH—A good programming environment for laboratory automation? II. An example from the laboratoryTrAC Trends in Analytical Chemistry, 1985