Optimal and practical WAB-based consensus algorithms

Authors:
Lasaro Camargos;Edmundo R. M. Madeira;Fernando Pedone
Affiliations:
,State University of Campinas, Brazil;State University of Campinas, Brazil;University of Lugano, Switzerland
Venue:
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Year:
2006

Citing 16
Cited 0

On the minimal synchronism needed for distributed consensus

Journal of the ACM (JACM)
Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
The weakest failure detector for solving consensus

Journal of the ACM (JACM)
Failure detectors in omission failure environments

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The part-time parliament

ACM Transactions on Computer Systems (TOCS)
On the cost of fault-tolerant consensus when there are no faults: preliminary version

ACM SIGACT News
Solving Agreement Problems with Weak Ordering Oracles

EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
Fast Indulgent Consensus with Zero Degradation

EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
Failure Detection and Consensus in the Crash-Recovery Model

DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Consensus in Asynchronous Systems Where Processes Can Crash and Recover

SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Uniform consensus is harder than consensus

Journal of Algorithms
Randomized byzantine generals

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce two new WAB-based consensus algorithms for the crash-recovery model. The first one, B*-Consensus, is resilient to up to f n/2 permanent faults, and can solve consensus in three communication steps. R*-Consensus, our second algorithm, is f n/3 resilient, and can solve consensus in two communication steps. These algorithms are optimal with respect to the time complexity versus resilience tradeoff. We compare our algorithms to other consensus algorithms in the crash-recovery model.