The k-simultaneous consensus problem

This paper introduces and investigates the k-simultaneous consensus task: each process participates at the same time in k independent consensus instances until it decides in any one of them. It is shown that the k-simultaneous consensus task is equivalent to the k-set agreement task in the wait-free read/write shared memory model, and furthermore k-simultaneous consensus possesses properties that k-set does not. In particular we show that the multivalued version and the binary version of the k-simultaneous consensus task are wait-free equivalent. These equivalences are independent of the number of processes. Interestingly, this provides us with a new characterization of the k-set agreement task that is based on the fundamental binary consensus problem.

[1]  Piotr Zielinski.  Anti-Ω: the weakest failure detector for set agreement , 2008, PODC '08.

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

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

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

[5]  Eli Gafni,et al.  Musical Benches , 2005, DISC.

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

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

[8]  Marcos K. Aguilera,et al.  A pleasant stroll through the land of infinitely many creatures , 2004, SIGA.

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

[10]  Leslie Lamport,et al.  Interprocess Communication , 2020, Practical System Programming with C.

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

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

[13]  Michel Raynal,et al.  Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus , 2006, ICDCN.

[14]  Nir Shavit,et al.  Atomic snapshots of shared memory , 1990, JACM.

[15]  Leslie Lamport,et al.  On interprocess communication , 1986, Distributed Computing.

[16]  Achour Mostéfaoui,et al.  From Binary Consensus to Multivalued Consensus in asynchronous message-passing systems , 2000, Inf. Process. Lett..

[17]  Eli Gafni,et al.  The concurrency hierarchy, and algorithms for unbounded concurrency , 2001, PODC '01.

[18]  Piotr Zielinski,et al.  Anti-Ω: the weakest failure detector for set agreement , 2010, PODC '08.

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

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

[21]  Michel Raynal,et al.  The Committee Decision Problem , 2006, LATIN.

[22]  Nancy A. Lynch,et al.  The BG distributed simulation algorithm , 2001, Distributed Computing.

[23]  Yoram Moses,et al.  Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures , 1986, TARK.

[24]  Michael Merritt,et al.  Computing with Infinitely Many Processes , 2000, DISC.