Advertisement

Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors

  • Michel Raynal
  • Julien Stainer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7355)

Abstract

The base distributed asynchronous read/write computation model is made up of n asynchronous processes which communicate by reading and writing atomic registers only. The distributed asynchronous iterated model is a more constrained model in which the processes execute an infinite number of rounds and communicate at each round with a new object called immediate snapshot object. Moreover, in both models up to n − 1 processes may crash in an unexpected way. When considering computability issues, two main results are associated with the previous models. The first states that they are computationally equivalent for decision tasks. The second states that they are no longer equivalent when both are enriched with the same failure detector.

This paper shows how to capture failure detectors in each model so that both models become computationally equivalent. To that end it introduces the notion of a “strongly correct” process which appears particularly well-suited to the iterated model, and presents simulations that prove the computational equivalence when both models are enriched with the same failure detector. The paper extends also these simulations to the case where the wait-freedom requirement is replaced by the notion of t-resilience.

Keywords

Simulated Process Decision Task Correct Process Failure Detector Correct Simulator 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming. In: Proc. 12th ACM PODC, pp. 41–51 (1993)Google Scholar
  2. 2.
    Borowsky, E., Gafni, E.: A simple algorithmically reasoned characterization of wait-free computations. In: Proc. 16th ACM PODC, pp. 189–198 (1997)Google Scholar
  3. 3.
    Chandra, T., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225–267 (1996)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Herlihy, M.P.: Wait-free synchronization. ACM TOPLAS 13(1), 124–149 (1991)CrossRefGoogle Scholar
  5. 5.
    Rajsbaum, S., Raynal, M., Travers, C.: The Iterated Restricted Immediate Snapshot Model. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 487–497. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 6.
    Rajsbaum, S., Raynal, M., Travers, C.: An impossibility about failure detectors in the iterated immediate snapshot model. Information Processing Letters 108(3), 160–164 (2008)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Raynal, M., Stainer, J.: Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors. Tech Report #1991, IRISA, Université de Rennes (F) (2011)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Michel Raynal
    • 1
    • 2
  • Julien Stainer
    • 1
  1. 1.IRISARennes CedexFrance
  2. 2.Institut Universitaire de FranceFrance

Personalised recommendations