Deterministic objects: Life beyond consensus

Yehuda Afek, Faith Ellen, Eli Gafni

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

For all integers m ≥ 2, we construct an innite sequence of deterministic objects of consensus number m with strictly increasing computational power. In particular, this refutes the Common2 Conjecture, which claimed that every deter- ministic object of consensus number 2 has a deterministic, wait-free implementation from 2-consensus objects and reg- isters in a system with any nite number of processes.

Original languageEnglish
Title of host publicationPODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages97-106
Number of pages10
ISBN (Electronic)9781450339643
DOIs
StatePublished - 25 Jul 2016
Event35th ACM Symposium on Principles of Distributed Computing, PODC 2016 - Chicago, United States
Duration: 25 Jul 201628 Jul 2016

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing
Volume25-28-July-2016

Conference

Conference35th ACM Symposium on Principles of Distributed Computing, PODC 2016
Country/TerritoryUnited States
CityChicago
Period25/07/1628/07/16

Keywords

  • Consistent ordered partition
  • Deterministic consensus hierarchy
  • Set-consensus
  • Simulation
  • Valency ar-gument

Cite this