From Unreliable Objects to Reliable Objects: The Case of Atomic Registers and Consensus

  • Rachid Guerraoui
  • Michel Raynal
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4671)


A concurrent object is an object that can be concurrently accessed by several processes. It has been shown by Maurice Herlihy that any concurrent object O defined by a sequential specification can be wait-free implemented from reliable atomic registers (shared variables) and consensus objects. Wait-free means that any invocation of an operation of the object O issued by a non-faulty process does terminate, whatever the behavior of the other processes (e.g., despite the fact they are very slow or even have crashed).

So, an important issue consists in providing reliable atomic registers and reliable consensus objects despite the failures experienced by the base objects from which these atomic registers and consensus objects are built. This paper considers self-implementations, i.e., the case where a reliable atomic register (resp., consensus object) is built from unreliable atomic registers (resp., unreliable consensus objects). The paper addresses the object failure model where the base objects can suffer responsive or nonresponsive crash failures. When there are solutions the paper presents corresponding algorithms, and when there is no solution, it presents the corresponding impossibility result. The paper has a tutorial flavor whose aim is to make the reader familiar with important results when one has to build resilient concurrent objects. To that aim, the paper use both algorithms from the literature and new algorithms.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, p. 451. McGraw-Hill, New York (1998)Google Scholar
  2. 2.
    Chandra, T., Toueg, S.: Unreliable Failure Detectors for Resilient Distributed Systems. Journal of the ACM 43(2), 225–267 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Guerraoui, R., Raynal, M.: A Universal Construction for Wait-free Objects. In: FOFDC 2007. Proc. ARES 2007 Workshop on Foundations of Fault-tolerant Distributed Computing, IEEE Society Computer Press, Vienna (Austria) (2007)Google Scholar
  4. 4.
    Herlihy, M.P.: Wait-Free Synchronization. ACM TOPLAS 13(1), 124–149 (1991)CrossRefGoogle Scholar
  5. 5.
    Herlihy, M.P., Wing, J.M: Linearizability: a Correctness Condition for Concurrent Objects. ACM TOPLAS 12(3), 463–492 (1990)CrossRefGoogle Scholar
  6. 6.
    Hoare, C.A.R.: Monitors: an Operating System Structuring Concept. Comm. ACM 17(10), 549–557 (1974)zbMATHCrossRefGoogle Scholar
  7. 7.
    Jayanti, P., Chandra, T., Toueg, S.: Fault-Tolerant Wait-Free Shared Objects. Journal of the ACM 45(3), 451–500 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Lamport, L.: Concurrent Reading and Writing. Comm. ACM 20(11), 806–811 (1977)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Lamport, L.: On Interprocess Communication, Part 1: Models, Part 2: Algorirhms. Distributed Computing 1(2), 77–101 (1986)zbMATHCrossRefGoogle Scholar
  10. 10.
    Raynal, M.: A Short Introduction to Failure Detectors for Asynchronous Distributed Systems. ACM Sigact News, Distributed Computing Column 36(1), 53–70 (2005)CrossRefGoogle Scholar
  11. 11.
    Vitányi, P., Awerbuch, B.: Atomic Shared Register Access by Asynchronous Hardware. In: FOCS 1986. Proc. 27th IEEE Symposium on Foundations of Computer Science, pp. 233–243. IEEE Computer Society Press, Los Alamitos (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Rachid Guerraoui
    • 1
  • Michel Raynal
    • 2
  1. 1.Distributed Programming Lab, EPFL, LausanneSwitzerland
  2. 2.IRISA, University of Rennes 1, 35042 RennesFrance

Personalised recommendations