A Topological Treatment of Early-Deciding Set-Agreement

This paper considers the k-set-agreement problem in a synchronous message passing distributed system where up to t processes can fail by crashing. We determine the number of communication rounds needed for all correct processes to reach a decision in a given run, as a function of k, the degree of coordination, and f ≤t the number of processes that actually fail in the run. We prove a lower bound of rounds. Our proof uses simple topological tools to reason about runs of a full information set-agreement protocol. In particular, we introduce a topological operator, which we call the early deciding operator, to capture rounds where k processes fail but correct processes see only k–1 failures.

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

[2]  Danny Dolev,et al.  Early stopping in Byzantine agreement , 1990, JACM.

[3]  Nancy A. Lynch,et al.  Consensus in the presence of partial synchrony , 1988, JACM.

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

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

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

[7]  Rachid Guerraoui,et al.  The inherent price of indulgence , 2002, PODC '02.

[8]  Maurice Herlihy,et al.  Algebraic spans , 1995, PODC '95.

[9]  André Schiper,et al.  Uniform consensus is harder than consensus , 2004, J. Algorithms.

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

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

[12]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

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

[14]  Idit Keidar,et al.  On the cost of fault-tolerant consensus when there are no faults: preliminary version , 2001, SIGA.

[15]  Idit Keidar,et al.  On the Cost of Fault-Tolerant Consensus When There Are No Faults - A Tutorial , 2003, LADC.

[16]  Rachid Guerraoui,et al.  From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement , 2005, STOC '05.

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

[18]  Rachid Guerraoui,et al.  Tight Bounds on Early Local Decisions in Uniform Consensus , 2003, DISC.

[19]  Eli Gafni,et al.  Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract). , 1998, PODC 1998.

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

[21]  Rachid Guerraoui,et al.  A Note on Set Agreement with Omission Failures , 2003, Electron. Notes Theor. Comput. Sci..