Why extension-based proofs fail

It 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, a class of impossibility proofs that are modelled as an interaction between a prover and a protocol and that include valency arguments. 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 show that this impossibility result cannot be obtained by an extension-based proof and, hence, extension-based proofs are limited in power.

[1]  Leqi Zhu.  A tight space bound for consensus , 2016, STOC.

[2]  Ami Paz,et al.  Hardness of Distributed Optimization , 2019, PODC.

[3]  Maurice Herlihy,et al.  Elements of Combinatorial Topology , 2014 .

[4]  Amos Israeli,et al.  On processor coordination using asynchronous hardware , 1987, PODC '87.

[5]  Karl R. Abrahamson.  On achieving consensus using a shared memory , 1988, PODC '88.

[6]  Eli Gafni,et al.  Generalized FLP impossibility result for t-resilient asynchronous computations , 1993, STOC.

[7]  Nir Shavit,et al.  Toward a Topological Characterization of Asynchronous Complexity , 2006, SIAM J. Comput..

[8]  Dan Alistarh,et al.  How To Elect a Leader Faster than a Tournament , 2015, PODC.

[9]  Eli Gafni,et al.  Immediate Atomic Snapshots and Fast Renaming (Extended Abstract). , 1993, PODC 1993.

[10]  Faith Ellen,et al.  Revisionist Simulations: A New Approach to Proving Space Lower Bounds , 2017, PODC.

[11]  Maurice Herlihy,et al.  Obstruction-free synchronization: double-ended queues as an example , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[12]  Nir Shavit,et al.  Towards a topological characterization of asynchronous complexity , 1997, PODC '97.

[13]  Kyrill Winkler,et al.  A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus , 2019, SSS.

[14]  Soma Chaudhuri,et al.  More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems , 1993, Inf. Comput..

[15]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

[16]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[17]  Yoram Moses,et al.  A Layered Analysis of Consensus , 2002, SIAM J. Comput..

[18]  Russell Impagliazzo,et al.  Exponential lower bounds for the pigeonhole principle , 1992, STOC '92.

[19]  Maurice Herlihy,et al.  Distributed Computing Through Combinatorial Topology , 2013 .

[20]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[21]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[22]  Maryam Helmi,et al.  The Space Complexity of Long-Lived and One-Shot Timestamp Implementations , 2011, JACM.

[23]  Maurice Herlihy,et al.  The topological structure of asynchronous computability , 1999, JACM.

[24]  Eli Gafni,et al.  A simple algorithmically reasoned characterization of wait-free computation (extended abstract) , 1997, PODC '97.

[25]  Faith Ellen,et al.  Impossibility Results for Distributed Computing , 2014, Impossibility Results for Distributed Computing.

[26]  Michael E. Saks,et al.  Wait-free k-set agreement is impossible: the topology of public knowledge , 1993, STOC.

[27]  Hagit Attiya,et al.  Counting-Based Impossibility Proofs for Renaming and Set Agreement , 2012, DISC.

[28]  Hagit Attiya,et al.  The Combinatorial Structure of Wait-Free Solvable Tasks , 2002, SIAM J. Comput..

[29]  Sergio Rajsbaum,et al.  New combinatorial topology bounds for renaming: the lower bound , 2010, Distributed Computing.

[30]  Faith Ellen,et al.  The space complexity of unbounded timestamps , 2008, Distributed Computing.

[31]  Hagit Attiya,et al.  A non-topological proof for the impossibility of k-set agreement , 2011, Theor. Comput. Sci..

[32]  Nancy A. Lynch,et al.  Bounds on Shared Memory for Mutual Exclusion , 1993, Inf. Comput..