Abstract
This paper presents a new consensus algorithm for the asynchronous message passing system model augmented with an unreliable failure detector abstraction. Our algorithm (a) matches all known consensus lower bounds on (1) failure detection, i.e., Ω, (2) resilience, i.e., a majority of correct processes, and (3) latency, i.e., two communication steps for a global decision in nice runs (when no process crashes and the failure detection is reliable), and (b) has the following zero degradation flavor: in every stable run of the algorithm (when all failures are initial crashes, and failure detection is reliable), two communication steps are sufficient to reach a global decision.
The zero degradation flavor is particularly important when consensus is used in a repeated form: failures in one consensus instance do not impact performance of future consensus instances.
This work is partially supported by the Swiss National Science Foundation (project number 510-207).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. K. Aguilera, W. Chen, and S. Toueg. Failure detection and consensus in the crash-recovery model. Distributed Computing, 13(2):99–125, May 2000.
F. Brasileiro, F. Greve, A. Mostefaoui, and M. Raynal. Consensus in one communication step. In Proceedings of the 6th International Conference on Parallel Computing Technology, pages 42–50, Novosibirsk, Russia, September 2001.
T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43(4):685–722, 1996.
T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225–267, 1996.
D. Dolev, C. Dwork, and L. Stockmeyer. On the minimal synchrony needed for distributed consensus. Journal of ACM, 34(1):77–97, 1987.
M. J. Fischer, N. A. Lynch, and M.S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374–382, 1985.
R. Guerraoui. Indulgent algorithms. In Proceedings of the 19th ACM Symposium on the Principles of Distributed Computing (PODC-19), pages 289–298, Portland, OR, July 2000.
M. Hurfin and M. Raynal. A simple and fast asynchronous consensus protocol based on a weak failure detector. Distributed Computing, 12(4):209–223, 1999.
V. Hadzilacos and S. Toueg. Fault-tolerant broadcasts and related problems. In S. Mullender, editor, Distributed Systems, ACM Press Books, chapter 5, pages 97–146. Addison-Wesley, second edition, 1993.
I. Keidar and S. Rajsbaum. On the cost of fault-tolerant consensus when there are no faults-a tutorial. Technical Report MIT-LCS-TR-821, MIT, May 2001.
L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, July 1978.
L. Lamport. The part-time parliament. Technical Report 49, System Research Center, Digital Equipment Corp, Palo Alto, September 1989. A revised version of the paper also appeared in ACM Transaction on Computer Systems, 16(2):133–169, May 1998.
A. Mostefaoui and M. Raynal. Leader-based consensus. Parallel Processing Letters, 11(1):95–107, March 2001.
A. Schiper. Early consensus in an asynchronous system with a weak failure detector. Distributed Computing, 10(3):149–157, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dutta, P., Guerraoui, R. (2002). Fast Indulgent Consensus with Zero Degradation. In: Bondavalli, A., Thevenod-Fosse, P. (eds) Dependable Computing EDCC-4. EDCC 2002. Lecture Notes in Computer Science, vol 2485. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36080-8_18
Download citation
DOI: https://doi.org/10.1007/3-540-36080-8_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00012-9
Online ISBN: 978-3-540-36080-3
eBook Packages: Springer Book Archive