A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
2010
Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '10
We show that consensus can be solved by an alternating sequence of adopt-commit objects [2, 25] , which detect agreement, and conciliators, which ensure agreement with some probability. We observe that most known randomized consensus algorithms have this structure. We give a deterministic implementation of an m-valued adopt-commit object for an unbounded number of processes that uses lg m + Θ(log log m) space and individual work. We also give a randomized conciliator for any number of values in
doi:10.1145/1835698.1835802
dblp:conf/podc/Aspnes10
fatcat:iypthg5uuvf5forxrycu2n5qkq