Cited By
View all- Alistarh DEllen FRybicki J(2021)Wait-Free Approximate Agreement on GraphsStructural Information and Communication Complexity10.1007/978-3-030-79527-6_6(87-105)Online publication date: 28-Jun-2021
Brief Announcement: Why Extension-Based Proofs Fail
Pages 54 - 56
Abstract
We introduce extension-based proofs, a class of impossibility proofs that includes valency arguments. They are modelled as an interaction between a prover and a protocol. Using proofs based on combinatorial topology, it has been shown that it is impossible to deterministically solve k-set agreement among n > k ≥ 2 processes in a wait-free manner. However, it was unknown whether proofs based on simpler techniques were possible. We explain why this impossibility result cannot be obtained by an extension-based proof and, hence, extension-based proofs are limited in power.
Reference
[1]
Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. 2019. Why Extension-based Proofs Fail. In Proceedings of the 51st Annual ACM Symposium on Theory of Computing (STOC). 986--996.
Index Terms
- Brief Announcement: Why Extension-Based Proofs Fail
Recommendations
Reductions and Extension-Based Proofs
PODC'21: Proceedings of the 2021 ACM Symposium on Principles of Distributed ComputingIn the theory of distributed computing, the notion of a reduction is a common tool for proving impossibility results. If task T reduces to task S, and T is impossible to solve, then so is S. Extension-based proofs demonstrate the impossibility of ...
Why extension-based proofs fail
STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of ComputingIt is impossible to deterministically solve wait-free consensus in an asynchronous system. The classic proof uses a valency argument, which constructs an infinite execution by repeatedly extending a finite execution. We introduce extension-based proofs, ...
Locally solvable tasks and the limitations of valency arguments
AbstractAn elegant strategy for proving impossibility results in distributed computing was introduced in the celebrated FLP consensus impossibility proof. This strategy is local in nature as at each stage, one configuration of a hypothetical ...
Highlights- Studies impossibility proofs for sub-consensus tasks in wait-free shared-memory.
Comments
Information & Contributors
Information
Published In
July 2020
539 pages
Copyright © 2020 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 31 July 2020
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
PODC '20: ACM Symposium on Principles of Distributed Computing
August 3 - 7, 2020
Virtual Event, Italy
Acceptance Rates
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 152Total Downloads
- Downloads (Last 12 months)41
- Downloads (Last 6 weeks)8
Reflects downloads up to 03 Oct 2024
Other Metrics
Citations
Cited By
View all- Alistarh DEllen FRybicki J(2021)Wait-Free Approximate Agreement on GraphsStructural Information and Communication Complexity10.1007/978-3-030-79527-6_6(87-105)Online publication date: 28-Jun-2021
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in