On the use of registers in achieving wait-free consensus

Rida Bazzi, Gil Neiger, Gary L. Peterson

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


The computational power of concurrent data types has been the focus of much recent research. Herlihy showed that such power may be measured by the type's ability to implement wait-free consensus. Jayanti argued that this ability could be measured in different ways, depending, for example, on whether or not read/write registers could be used in an implementation. He demonstrated the significance of this distinction by exhibiting a non-deterministic type whose ability to implement consensus was increased with the availability of registers. We show that registers cannot increase the ability to implement wait-free consensus of any deterministic type or of any type that can, without them, implement consensus for at least two processes. These results significantly impact the study of the wait-free hierarchies of concurrent data types. In particular, the combination of these results with other recent work suggests that Jayanti's hm hierarchy is robust for certain classes of deterministic types.

Original languageEnglish (US)
Pages (from-to)117-127
Number of pages11
JournalDistributed Computing
Issue number3
StatePublished - 1997


  • Consensus
  • Registers
  • Robustness
  • Wait-free computation
  • Wait-free hierarchies

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computational Theory and Mathematics


Dive into the research topics of 'On the use of registers in achieving wait-free consensus'. Together they form a unique fingerprint.

Cite this