Highly Influenced

# Time- and Space-Efficient Randomized Consensus

@inproceedings{Aspnes1990TimeAS, title={Time- and Space-Efficient Randomized Consensus}, author={James Aspnes}, booktitle={PODC}, year={1990} }

- Published 1990 in PODC
DOI:10.1145/93385.93433

An algorithm is presented which solves the randomized consensus problem [7] for shared memory. The algorithm uses O(p2 + n) worst-case expected operations on a set of three shared O(log n)-bit counters, where p is the number of active processors and n is the total number of processors; it thus requires less space than previous polynomial-time consensus protocols [4,6], and is faster when not all of the processors participate in the protocol. A modified version of the protocol yields a weak… CONTINUE READING

Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=93433.