LIPIcs.DISC.2024.54.pdf
- Filesize: 0.54 MB
- 6 pages
Document
Brief Announcement: Colorless Tasks and Extension-Based Proofs
Authors
Yusong Shi 
,
Weidong Liu
-
Part of:
Volume:
38th International Symposium on Distributed Computing (DISC 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Distributed Computing (DISC) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-10-24
File
Document Identifiers
Author Details
Acknowledgements
We would like to thank Faith Ellen and Shihao Liu for helpful discussions and the anonymous reviewers for their comments.
Cite As Get BibTex
Yusong Shi and Weidong Liu. Brief Announcement: Colorless Tasks and Extension-Based Proofs. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 54:1-54:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.DISC.2024.54
Abstract
The concept of extension-based proofs models the idea of a valency argument, which is widely used in distributed computing. Extension-based proofs are limited in power: it has been shown that there is no extension-based proof of the impossibility of a wait-free protocol for (n,k)-set agreement among n > k ≥ 2 processes. There are only a few tasks that have been proven to have no extension-based proof of the impossibility, since the techniques in these works are closely related to the specific task. We give a necessary and sufficient condition for colorless tasks to have no extension-based proofs of the impossibility of wait-free protocols in the NIIS model. We introduce a general adversarial strategy decoupled from any concrete task specification. In this strategy, some properties of the chromatic subdivision that is widely used in distributed computing are proved.
Subject Classification
ACM Subject Classification
- Theory of computation → Interactive proof systems
- Theory of computation → Distributed algorithms
- Theory of computation → Distributed computing models
- Theory of computation → Problems, reductions and completeness
Keywords
- Colorless tasks
- Impossibility proofs
- Extension-based proof
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. Why extension-based proofs fail. Proceedings of the 51’st Annual ACM Symposium on Theory of Computing (STOC), pages 986-996, 2019. URL: https://doi.org/10.1145/3313276.3316407.
- Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. Why extension-based proofs fail. SIAM Journal on Computing, 52(4):913-944, 2023. URL: https://doi.org/10.1137/20M1375851.
- Dan Alistarh, Faith Ellen, and Joel Rybicki. Wait-free approximate agreement on graphs. In Structural Information and Communication Complexity: 28th International Colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021, Proceedings, pages 87-105, Berlin, Heidelberg, 2021. Springer-Verlag. URL: https://doi.org/10.1007/978-3-030-79527-6_6.
- Elizabeth Borowsky and Eli Gafni. Generalized flp impossibility result for t-resilient asynchronous computations. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC '93, pages 91-100, New York, NY, USA, 1993. Association for Computing Machinery. URL: https://doi.org/10.1145/167088.167119.
- Elizabeth Borowsky and Eli Gafni. Immediate atomic snapshots and fast renaming. In Proceedings of the Twelfth Annual ACM Symposium on Principles of Distributed Computing, PODC '93, pages 41-51, New York, NY, USA, 1993. Association for Computing Machinery. URL: https://doi.org/10.1145/164051.164056.
- Soma Chaudhuri. More choices allow more faults: Set consensus problems in totally asynchronous systems. Inf. Comput., 105(1):132-158, July 1993. URL: https://doi.org/10.1006/inco.1993.1043.
- Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374-382, April 1985. URL: https://doi.org/10.1145/3149.214121.
- Maurice Herlihy and Nir Shavit. The topological structure of asynchronous computability. J. ACM, 46(6):858-923, November 1999. URL: https://doi.org/10.1145/331524.331529.
- Gunnar Hoest and Nir Shavit. Toward a topological characterization of asynchronous complexity. SIAM Journal on Computing, 36(2):457-497, 2006. URL: https://doi.org/10.1137/S0097539701397412.
- Shihao Liu. The Impossibility of Approximate Agreement on a Larger Class of Graphs. In Eshcar Hillel, Roberto Palmieri, and Etienne Rivière, editors, 26th International Conference on Principles of Distributed Systems (OPODIS 2022), volume 253 of Leibniz International Proceedings in Informatics (LIPIcs), pages 22:1-22:20, Dagstuhl, Germany, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.OPODIS.2022.22.
- Michael Saks and Fotios Zaharoglou. Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM J. Comput., 29(5):1449-1483, March 2000. URL: https://doi.org/10.1137/S0097539796307698.
- Yusong Shi and Weidong Liu. Colorless tasks and extension-based proofs, 2023. URL: https://arxiv.org/abs/2303.14769.