Advertisement

Distributed Computing

, Volume 13, Issue 4, pp 219–238 | Cite as

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

  • Wai-Kau Lo
  • Vassos Hadzilacos
Original articles

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.

Key words:Distributed algorithms – Fault-tolerance – Shared objects – Consensus 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Wai-Kau Lo
    • 1
  • Vassos Hadzilacos
    • 1
  1. 1.University of Toronto, Toronto, Ontario, Canada M55 3H5 (e-mail:{wklo,vassos}@cs.utoronto.ca) CA

Personalised recommendations