On the use of registers in achieving wait-free consensus

Rida Bazzi, Gil Neiger, Gary L. Peterson

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

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
Volume10
Issue number3
StatePublished - 1997

Fingerprint

Wait-free
Availability
Concurrent
Hierarchy

Keywords

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

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

Bazzi, R., Neiger, G., & Peterson, G. L. (1997). On the use of registers in achieving wait-free consensus. Distributed Computing, 10(3), 117-127.

On the use of registers in achieving wait-free consensus. / Bazzi, Rida; Neiger, Gil; Peterson, Gary L.

In: Distributed Computing, Vol. 10, No. 3, 1997, p. 117-127.

Research output: Contribution to journalArticle

Bazzi, R, Neiger, G & Peterson, GL 1997, 'On the use of registers in achieving wait-free consensus', Distributed Computing, vol. 10, no. 3, pp. 117-127.
Bazzi, Rida ; Neiger, Gil ; Peterson, Gary L. / On the use of registers in achieving wait-free consensus. In: Distributed Computing. 1997 ; Vol. 10, No. 3. pp. 117-127.
@article{c8088e8d0c1e4a228292a66bcad29be5,
title = "On the use of registers in achieving wait-free consensus",
abstract = "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.",
keywords = "Consensus, Registers, Robustness, Wait-free computation, Wait-free hierarchies",
author = "Rida Bazzi and Gil Neiger and Peterson, {Gary L.}",
year = "1997",
language = "English (US)",
volume = "10",
pages = "117--127",
journal = "Distributed Computing",
issn = "0178-2770",
publisher = "Springer Verlag",
number = "3",

}

TY - JOUR

T1 - On the use of registers in achieving wait-free consensus

AU - Bazzi, Rida

AU - Neiger, Gil

AU - Peterson, Gary L.

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

KW - Consensus

KW - Registers

KW - Robustness

KW - Wait-free computation

KW - Wait-free hierarchies

UR - http://www.scopus.com/inward/record.url?scp=0031122722&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031122722&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0031122722

VL - 10

SP - 117

EP - 127

JO - Distributed Computing

JF - Distributed Computing

SN - 0178-2770

IS - 3

ER -