A gap theorem for consensus types

Gary L. Peterson, Rida Bazzi, Gil Neiger

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

14 Citations (Scopus)

Abstract

This paper presents a strong characterization that precisely determines the ability of n-process deterministic types to solve n-process wait-free consensus. This characterization, called the High Gap Theorem, has several important corollaries including a proof that Jayanti's hierarchy that allows multiple copies and read/write shared memory 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
Pages344-353
Number of pages10
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

Data storage equipment

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Peterson, G. L., Bazzi, R., & Neiger, G. (1994). A gap theorem for consensus types. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994 (Vol. Part F129432, pp. 344-353). Association for Computing Machinery. https://doi.org/10.1145/197917.198123

A gap theorem for consensus types. / Peterson, Gary L.; Bazzi, Rida; Neiger, Gil.

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

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

Peterson, GL, Bazzi, R & Neiger, G 1994, A gap theorem for consensus types. in Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994. vol. Part F129432, Association for Computing Machinery, pp. 344-353, 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994, Los Angeles, United States, 8/14/94. https://doi.org/10.1145/197917.198123
Peterson GL, Bazzi R, Neiger G. A gap theorem for consensus types. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994. Vol. Part F129432. Association for Computing Machinery. 1994. p. 344-353 https://doi.org/10.1145/197917.198123
Peterson, Gary L. ; Bazzi, Rida ; Neiger, Gil. / A gap theorem for consensus types. Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994. Vol. Part F129432 Association for Computing Machinery, 1994. pp. 344-353
@inproceedings{7b921dcab0b249eb8f30ccb784e9a5d5,
title = "A gap theorem for consensus types",
abstract = "This paper presents a strong characterization that precisely determines the ability of n-process deterministic types to solve n-process wait-free consensus. This characterization, called the High Gap Theorem, has several important corollaries including a proof that Jayanti's hierarchy that allows multiple copies and read/write shared memory is robust for deterministic types.",
author = "Peterson, {Gary L.} and Rida Bazzi and Gil Neiger",
year = "1994",
month = "8",
day = "14",
doi = "10.1145/197917.198123",
language = "English (US)",
volume = "Part F129432",
pages = "344--353",
booktitle = "Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - A gap theorem for consensus types

AU - Peterson, Gary L.

AU - Bazzi, Rida

AU - Neiger, Gil

PY - 1994/8/14

Y1 - 1994/8/14

N2 - This paper presents a strong characterization that precisely determines the ability of n-process deterministic types to solve n-process wait-free consensus. This characterization, called the High Gap Theorem, has several important corollaries including a proof that Jayanti's hierarchy that allows multiple copies and read/write shared memory is robust for deterministic types.

AB - This paper presents a strong characterization that precisely determines the ability of n-process deterministic types to solve n-process wait-free consensus. This characterization, called the High Gap Theorem, has several important corollaries including a proof that Jayanti's hierarchy that allows multiple copies and read/write shared memory is robust for deterministic types.

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

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

U2 - 10.1145/197917.198123

DO - 10.1145/197917.198123

M3 - Conference contribution

VL - Part F129432

SP - 344

EP - 353

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

PB - Association for Computing Machinery

ER -