Randomized consensus in expected O(n log n) individual work
James Aspnes, Hagit Attiya, Keren Censor · 2008
This paper presents a new randomized algorithm for achieving consensus among asynchronous processes that communicate by reading and writing shared registers, in the presence of a strong adversary. The fastest previously known algorithm requires a process to perform an expected O(n log2 n) read and write operations in the worst case. In our algorithm, each process executes at most an expected O(n log n) read and write operations. It is shown that shared-coin algorithms can be combined together to yield an algorithm with O(n log n) individual work and O(n2) total work.