Advertisement

Easy Consensus Algorithms for the Crash-Recovery Model

  • Felix C. Freiling
  • Christian Lambertz
  • Mila Majster-Cederbaum
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5218)

Abstract

Problem Setting. One of the most popular failure models for asynchronous fault-tolerant distributed systems is called crash-stop, which allows that a certain number of processes stops executing steps during the computation. Despite its theoretical interest, crash-stop is not expressive enough to model many realistic scenarios. In practice, processes crash but their processors reboot and the crashed process is restarted from a recovery point and rejoins the computation. This behavior is formalized as a failure model called crash-recovery, in which the processes can crash and recover multiple times.

References

  1. 1.
    Aguilera, M.K., Chen, W., Toueg, S.: Failure detection and consensus in the crash recovery model. Distributed Computing 13(2), 99–125 (2000)CrossRefGoogle Scholar
  2. 2.
    Freiling, F.C., Lambertz, C., Majster-Cederbaum, M.: Easy Consensus Algorithms for the Crash-Recovery Model. Tech. Report, TR-2008-002, Univ. of Mannheim (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Felix C. Freiling
    • 1
  • Christian Lambertz
    • 1
  • Mila Majster-Cederbaum
    • 1
  1. 1.Department of Computer ScienceUniversity of MannheimGermany

Personalised recommendations