Distributed Algorithms

Volume 972 of the series Lecture Notes in Computer Science pp 87-100


Revisiting the relationship between non-blocking atomic commitment and consensus

  • Rachid GuerraouiAffiliated withDépartement d'Informatique, Ecole Polytechnique Fédérale de Lausanne

* Final gross prices may vary according to local VAT.

Get Access


This paper discusses the relationship between the Non-Blocking Atomic Commitment problem (NB-AC) and the Consensus problem in asynchronous systems with unreliable failure detectors. We first confirm that NB-AC is harder than Consensus. In contrast to Consensus, NB-AC is impossible to solve with unreliable failure detectors even with a single crash failure. We define a weaker problem than NB-AC, called Non-Blocking Weak Atomic Commitment (NB-WAC), which is sufficient to solve for most practical situations. A fundamental characteristic of NB-WAC is its reducibility to Consensus. The previous results on solving Consensus with unreliable failure detectors apply therefore to NB-WAC. An interesting intermediate result of this reducibility is that Uniform Consensus and Consensus are equivalent problems. We show actually that any algorithm that solves Consensus with unreliable failure detectors also solves Uniform Consensus.