Modular Consensus Algorithms for the Crash-Recovery Model
Freiling F, Lambertz C, Majster-Cederbaum M (2009)
Publication Type: Conference contribution, Original article
Publication year: 2009
Edited Volumes: Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings
Pages Range: 287-292
Conference Proceedings Title: International Conference on Parallel and Distributed Computing, Applications and Technologies
Event location: Hiroshima, Japan
Abstract
In the crash-recovery failure model of asynchronous distributed systems, processes can temporarily stop to execute steps and later restart their computation from a predefined local state. The crash-recovery model is much more realistic than the crash-stop failure model in which processes merely are allowed to stop executing steps. The additional complexity Is reflected in the multitude of assumptions and the technical complexity of algorithms which have been developed for that model. We focus on the problem of consensus in the crash-recovery model, but instead of developing completely new algorithms from scratch, our approach alms at re-using existing crash-stop consensus algorithms in a modular way using the abstraction of failure detectors. As a result, we present three new consensus algorithms for the crash-recovery model for different types of assumptions. © 2009 IEEE.
Authors with CRIS profile
How to cite
APA:
Freiling, F., Lambertz, C., & Majster-Cederbaum, M. (2009). Modular Consensus Algorithms for the Crash-Recovery Model. In International Conference on Parallel and Distributed Computing, Applications and Technologies (pp. 287-292). Hiroshima, Japan, JP.
MLA:
Freiling, Felix, Christian Lambertz, and Mila Majster-Cederbaum. "Modular Consensus Algorithms for the Crash-Recovery Model." Proceedings of the International Workshop on Reliability, Availability, and Security, Hiroshima, Japan 2009. 287-292.
BibTeX: Download