Randomization and failure detection: A hybrid approach to solve consensus

Abstract

We present a Consensus algorithm that combines randomization and unreliable failure detection, two well-known techniques for solving Consensus in asynchronous systems with crash failures. This hybrid algorithm combines advantages from both approaches: it guarantees deterministic termination if the failure detector is accurate, and probabilistic termination otherwise. In executions with no failures or failure detector mistakes, the most likely ones in practice, Consensus is reached in only two asynchronous rounds.