An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems

We present a unified, axiomatic approach to proving lower bounds for the k-set agreement problem in both synchronous and asynchronous message-passing models. The proof involves constructing the set of reachable states, proving that these states are highly connected, and then appealing to a well-known topological result that high connectivity implies that set agreement is impossible. We construct the set of reachable states in an iterative fashion using a round operator that we define, and our proof of connectivity is an inductive proof based on this iterative construction and simple properties of the round operator.

[1]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[2]  Maurice Herlihy,et al.  Algebraic spans , 2000 .

[3]  R. Ho.  Algebraic Topology , 2022 .

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

[5]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[6]  Maurice Herlihy,et al.  Tight Bounds for K-set Agreement with Limited-scope Failure Detectors , 2003, PODC.

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

[8]  Eli Gafni,et al.  Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony , 1998, PODC '98.

[9]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[10]  Maurice Herlihy,et al.  Set consensus using arbitrary objects (preliminary version) , 1994, PODC '94.

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

[12]  M. Wachs.  SHELLABLE NONPURE COMPLEXES AND POSETS , 1996 .

[13]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

[14]  Achour Mostéfaoui,et al.  The Synchronous Condition-Based Consensus Hierarchy , 2004, DISC.

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

[16]  Hagit Attiya,et al.  The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract) , 1996, WDAG.

[17]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[18]  Soma Chaudhuri,et al.  Agreement is harder than consensus: set consensus problems in totally asynchronous systems , 1990, PODC '90.

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

[20]  Nancy A. Lynch,et al.  Tight bounds for k-set agreement , 2000, J. ACM.

[21]  Michelle L. Wachs,et al.  Shellable nonpure complexes and posets. II , 1996 .

[22]  Maurice Herlihy,et al.  Unifying synchronous and asynchronous message-passing models , 1998, PODC '98.