Fast Indulgent Consensus with Zero Degradation
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.
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, July 1978.Google Scholar
- 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.Google Scholar
- A. Mostefaoui and M. Raynal. Leader-based consensus. Parallel Processing Letters, 11(1):95–107, March 2001.Google Scholar