Randomized consensus in expected O(n2) total work using single-writer registers

Abstract

A new weak shared coin protocol yields a randomized wait-free shared-memory consensus protocol that uses an optimal O(n 2) expected total work with single-writer registers despite asynchrony and process crashes. Previously, no protocol was known that achieved this bound without using multi-writer registers. © 2011 Springer-Verlag.