Brief announcement: Pareto optimal solutions to consensus and set consensus

Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses

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

Abstract

A protocol P is Pareto-optimal if no protocol Q can decide as fast as P for all adversaries, while allowing at least one process to decide strictly earlier, in at least one instance. Pareto optimal protocols cannot be improved upon. We present the first Pareto-optimal solutions to consensus and k-set consensus for synchronous message-passing with crashes failures. Our k-set consensus protocol strictly dominates all known solutions, and our results expose errors in [1, 7, 8, 12]. Our proofs of Pareto optimality are completely constructive, and are devoid of any topological arguments or reductions.

Original languageEnglish
Title of host publicationPODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages113-115
Number of pages3
ISBN (Print)9781450320658
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 ACM Symposium on Principles of Distributed Computing, PODC 2013 - Montreal, QC, Canada
Duration: 22 Jul 201324 Jul 2013

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference2013 ACM Symposium on Principles of Distributed Computing, PODC 2013
Country/TerritoryCanada
CityMontreal, QC
Period22/07/1324/07/13

Keywords

  • Consensus
  • K-set consensus
  • Knowledge
  • Optimality

Fingerprint

Dive into the research topics of 'Brief announcement: Pareto optimal solutions to consensus and set consensus'. Together they form a unique fingerprint.

Cite this