Brief announcement: pareto optimal solutions to consensus and set consensus

Authors:
Armando Castañeda;Yannai A. Gonczarowski;Yoram Moses
Affiliations:
Technion, Haifa, Israel;Hebrew University of Jerusalem, Jerusalem, Israel;Technion, Haifa, Israel
Venue:
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Year:
2013

Citing 14
Cited 1

Knowledge and common knowledge in a distributed environment

Journal of the ACM (JACM)
A characterization of eventual Byzantine agreement

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Early stopping in Byzantine agreement

Journal of the ACM (JACM)
Knowledge and common knowledge in a byzantine environment: crash failures

Information and Computation
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
Tight bounds for k-set agreement

Journal of the ACM (JACM)
A Characterization of Eventual Byzantine Agreement

SIAM Journal on Computing
Reasoning About Knowledge

Reasoning About Knowledge
A topological treatment of early-deciding set-agreement

Theoretical Computer Science
The Complexity of Early Deciding Set Agreement: How can Topology help?

Electronic Notes in Theoretical Computer Science (ENTCS)
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The Complexity of Early Deciding Set Agreement

SIAM Journal on Computing
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement

Algorithmica
Early-stopping k-set agreement in synchronous systems prone to any number of process crashes

PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies

Bremen workshop review

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

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.