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

Authors:
Wai-Kau Lo;Vassos Hadzilacos
Affiliations:
University of Toronto, Toronto, Ontario, Canada M55 3H5;University of Toronto, Toronto, Ontario, Canada M55 3H5
Venue:
Distributed Computing
Year:
2000

Citing 10
Cited 1

The mutual exclusion problem: part I—a theory of interprocess communication

Journal of the ACM (JACM)
Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
On the robustness of Herlihy's hierarchy

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Generalized FLP impossibility result for t-resilient asynchronous computations

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
More on t-resilience vs. wait-freedom (extended abstract)

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
On the Borowsky-Gafni simulation algorithm

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Wait-free Computing

WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
On the relative power of shared objects in fault-tolerant distributed systems

On the relative power of shared objects in fault-tolerant distributed systems

Hundreds of impossibility results for distributed computing

Distributed Computing - Papers in celebration of the 20th anniversary of PODC

Quantified Score

Hi-index	0.00

Visualization

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 ≥ 3 and S be a set of object types that can be used to solve one-resilient Consensus among n processes. Can 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 S consists only of deterministic 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.