On the use of registers in achieving wait-free consensus

Rida Bazzi, Gil Neiger, Gary L. Peterson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 examining 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 nondeterministic type whose ability to implement consensus was increased with the availability of registers. We show that registers cannot increase the computational power (to implement consensus) of any deterministic type or of any type that can implement 2-process consensus. These results significantly impact upon the study of the wait-free hierarchies of concurrent data types. In particular, the combination of these results with other recent works shows that Jayanti's hm hierarchy is robust for deterministic types.

Original languageEnglish (US)
Title of host publicationProceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994
PublisherAssociation for Computing Machinery
Pages354-362
Number of pages9
VolumePart F129432
ISBN (Electronic)0897916549
DOIs
StatePublished - Aug 14 1994
Externally publishedYes
Event13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994 - Los Angeles, United States
Duration: Aug 14 1994Aug 17 1994

Other

Other13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994
CountryUnited States
CityLos Angeles
Period8/14/948/17/94

Fingerprint

Availability

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Bazzi, R., Neiger, G., & Peterson, G. L. (1994). On the use of registers in achieving wait-free consensus. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994 (Vol. Part F129432, pp. 354-362). Association for Computing Machinery. https://doi.org/10.1145/197917.198124

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

Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994. Vol. Part F129432 Association for Computing Machinery, 1994. p. 354-362.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bazzi, R, Neiger, G & Peterson, GL 1994, On the use of registers in achieving wait-free consensus. in Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994. vol. Part F129432, Association for Computing Machinery, pp. 354-362, 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994, Los Angeles, United States, 8/14/94. https://doi.org/10.1145/197917.198124
Bazzi R, Neiger G, Peterson GL. On the use of registers in achieving wait-free consensus. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994. Vol. Part F129432. Association for Computing Machinery. 1994. p. 354-362 https://doi.org/10.1145/197917.198124
Bazzi, Rida ; Neiger, Gil ; Peterson, Gary L. / On the use of registers in achieving wait-free consensus. Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994. Vol. Part F129432 Association for Computing Machinery, 1994. pp. 354-362
@inproceedings{a69d0cab23d747d79420cb11da305d86,
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 examining 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 nondeterministic type whose ability to implement consensus was increased with the availability of registers. We show that registers cannot increase the computational power (to implement consensus) of any deterministic type or of any type that can implement 2-process consensus. These results significantly impact upon the study of the wait-free hierarchies of concurrent data types. In particular, the combination of these results with other recent works shows that Jayanti's hm hierarchy is robust for deterministic types.",
author = "Rida Bazzi and Gil Neiger and Peterson, {Gary L.}",
year = "1994",
month = "8",
day = "14",
doi = "10.1145/197917.198124",
language = "English (US)",
volume = "Part F129432",
pages = "354--362",
booktitle = "Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994",
publisher = "Association for Computing Machinery",

}

TY - GEN

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

AU - Bazzi, Rida

AU - Neiger, Gil

AU - Peterson, Gary L.

PY - 1994/8/14

Y1 - 1994/8/14

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 examining 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 nondeterministic type whose ability to implement consensus was increased with the availability of registers. We show that registers cannot increase the computational power (to implement consensus) of any deterministic type or of any type that can implement 2-process consensus. These results significantly impact upon the study of the wait-free hierarchies of concurrent data types. In particular, the combination of these results with other recent works shows that Jayanti's hm hierarchy is robust for 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 examining 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 nondeterministic type whose ability to implement consensus was increased with the availability of registers. We show that registers cannot increase the computational power (to implement consensus) of any deterministic type or of any type that can implement 2-process consensus. These results significantly impact upon the study of the wait-free hierarchies of concurrent data types. In particular, the combination of these results with other recent works shows that Jayanti's hm hierarchy is robust for deterministic types.

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

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

U2 - 10.1145/197917.198124

DO - 10.1145/197917.198124

M3 - Conference contribution

AN - SCOPUS:84955609437

VL - Part F129432

SP - 354

EP - 362

BT - Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994

PB - Association for Computing Machinery

ER -