A gap theorem for consensus types

Gary L. Peterson, Rida A. Bazzi, Gil Neiger

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

14 Scopus citations

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

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing
VolumePart F129432

Other

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

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'A gap theorem for consensus types'. Together they form a unique fingerprint.

  • Cite this

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