On the power of shared object types to implement one-resilient Consensus

Abstract. In this paper we study the ability of shared object types to implement Consensus in asynchronous shared-memory systems where at most one process may crash. More specifically, we consider the following question: Let $n\ge3$ and $\mathcal{S}$ be a set of object types that can be used to solve one-resilient Consensus among n processes. Can $\mathcal{S}$ always be used to solve one-resilient Consensus among n - 1 processes? We prove that for n = 3 the answer is negative, even if $\mathcal{S}$ consists only ofdeterministic types. (This strengthens an earlier result by the first author proving the same fact for nondeterministic types.) We also prove that, in contrast, for $n>3$ the answer to the above question is affirmative.

[1]  Prasad Jayanti,et al.  Wait-free Computing , 1995, WDAG.

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

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

[4]  N. Lynch.  On the Borowsky-Gafni Simulation Algorithm ( Extended Abstract ) , 1996 .

[5]  Sam Toueg,et al.  Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract) , 1994, PODC '94.

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

[7]  Nancy A. Lynch,et al.  On the Borowsky-Gafni simulation algorithm , 1996, PODC '96.

[8]  Leslie Lamport,et al.  How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.

[9]  Vassoe Hadzilacos,et al.  On the relative power of shared objects in fault-tolerant distributed systems , 1997 .

[10]  Leslie Lamport,et al.  The mutual exclusion problem: part I—a theory of interprocess communication , 1986, JACM.

[11]  Michael Stumm,et al.  Fault tolerant distributed shared memory algorithms , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[12]  Prasad Jayanti.  On the robustness of Herlihy's hierarchy , 1993, PODC '93.

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

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

[15]  Wai-Kau Lo,et al.  More on t-resilience vs. wait-freedom (extended abstract) , 1995, PODC '95.

[16]  Vassos Hadzilacos,et al.  On the power of shared object types to implement one-resilient Consensus , 1997, PODC '97.

[17]  Nancy A. Lynch,et al.  Mutual exclusion using indivisible reads and writes , 1980 .