Revisiting the relationship between non-blocking atomic commitment and consensus

  • Rachid Guerraoui
Conference paper

DOI: 10.1007/BFb0022140

Part of the Lecture Notes in Computer Science book series (LNCS, volume 972)
Cite this paper as:
Guerraoui R. (1995) Revisiting the relationship between non-blocking atomic commitment and consensus. In: Hélary JM., Raynal M. (eds) Distributed Algorithms. WDAG 1995. Lecture Notes in Computer Science, vol 972. Springer, Berlin, Heidelberg


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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Rachid Guerraoui
    • 1
  1. 1.Département d'InformatiqueEcole Polytechnique Fédérale de LausanneLausanneSwitzerland

Personalised recommendations