Consensus power makes (some) sense!

Elizabeth Borowsky, Eli Gafni, Yehuda Afek

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

Abstract

This paper presents partial results of an ongoing investigation into the computability power of processors that are computing wait-free while synchronizing through various deterministic linearizable synchronization objects. Our main result is that any task over ≤ In processors, solvable using objects that cannot implement n + 1 process consensus, can be solved using only n process consensus objects. We also identify two new object implementation notions: protocol-implementation and taskimplementation. We show that objects that cannot implement n + 1 process consensus are protocolimplementable by n process consensus objects. A corollary of the latter result is that the class of objects that do not implement n+1 process consensus is closed under composition (i.e., in the terminology of [17], Herlihy's hierarchy is robust). With these two results, we substantiate for the first time Herlihy's consensus number n notion for objects with fan-in greater than n.

Original languageEnglish
Title of host publicationProceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994
PublisherAssociation for Computing Machinery
Pages363-372
Number of pages10
ISBN (Electronic)0897916549
DOIs
StatePublished - 14 Aug 1994
Event13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994 - Los Angeles, United States
Duration: 14 Aug 199417 Aug 1994

Publication series

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

Conference

Conference13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994
Country/TerritoryUnited States
CityLos Angeles
Period14/08/9417/08/94

Fingerprint

Dive into the research topics of 'Consensus power makes (some) sense!'. Together they form a unique fingerprint.

Cite this