1;3409;0c Lower bounds for asynchronous consensus

Lower bounds for asynchronous consensus

Distributed Computing, vol. 19, no. 2, 2006
Pages: 104-125DOI: 10.1007/s00446-006-0155-x



Impossibility results and best-case lower bounds are proved for the number of message delays and the number of processes required to reach agreement in an asynchronous consensus algorithm that tolerates non-Byzantine failures. General algorithms exist that achieve these lower bounds in the normal case, when the response time of non-faulty processes and the transmission delay of messages they send to one another are bounded. Our theorems allow algorithms to do better in certain exceptional cases, and such algorithms are presented. Two of these exceptional algorithms may be of practical interest.