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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aguilera, M.K., Chen, W., Toueg, S.: Failure detection and consensus in the crash recovery model. Distributed Computing 13(2), 99–125 (2000)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freiling, F.C., Lambertz, C., Majster-Cederbaum, M. (2008). Easy Consensus Algorithms for the Crash-Recovery Model. In: Taubenfeld, G. (eds) Distributed Computing. DISC 2008. Lecture Notes in Computer Science, vol 5218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87779-0_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-87779-0_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87778-3
Online ISBN: 978-3-540-87779-0
eBook Packages: Computer ScienceComputer Science (R0)