Randomized consensus in expected O(Nlog(2)N) operations per processor

This paper presents a new randomized algorithm for achieving consensus among asynchronous processors that communicate by reading and writing shared registers. The fastest previously known algorithm requires a processor to perform an expected O(n(2) log n) read and write operations in the worst case. In our algorithm, each processor executes at, most an expected O(n log(2) n) read and write operations, which is close to the trivial lower bound of Omega(n). All previously known polynomial-time consensus algorithms were structured around a shared-coin protocol [J. Algorithms, 11 (1990), pp. 441-446] in which each processor repeatedly adds random fl votes to a common pool. Consequently, in all of these protocols, the worst-case expected bound on the number of read and write operations done by a single processor is asymptotically no better than the bound on the total number of read and write operations done by all of the processors together, We succeed in breaking this tradition by allowing the processors to cast votes of increasing weights. This grants the adversary greater control since he can cheese from up to n different weights (one for each processor) when determining the weight of the next vote to be cast. We prove that our shared-coin protocol is nevertheless correct using martingale arguments.