Wait-Free Consensus Using Asynchronous Hardware
SIAM Journal on Computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Polylog randomized wait-free consensus
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Efficient asynchronous consensus with the weak adversary scheduler
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Tight bounds for asynchronous randomized consensus
Journal of the ACM (JACM)
Approximate shared-memory counting despite a strong adversary
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
SIAM Journal on Computing
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Combining shared-coin algorithms
Journal of Parallel and Distributed Computing
Tight bounds for anonymous adopt-commit objects
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Linearizable implementations do not suffice for randomized distributed computation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Sub-logarithmic test-and-set against aweak adversary
DISC'11 Proceedings of the 25th international conference on Distributed computing
Randomized consensus in expected O(n2) total work using single-writer registers
DISC'11 Proceedings of the 25th international conference on Distributed computing
Lower Bounds for Randomized Consensus under a Weak Adversary
SIAM Journal on Computing
On the time and space complexity of randomized test-and-set
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
On the time and space complexity of randomized test-and-set
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Randomized loose renaming in o(log log n) time
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that guarantees termination and validity, but that only guarantees agreement with constant probability. The first conciliator assumes unit-cost snapshots and achieves agreement among n processes with probability 1-μ in O(log* n + log(1/μ)) steps for each process. The second uses ordinary multi-writer registers, and achieves agreement with probability 1-μ in O(log log n + log(1/μ)) steps. Combining these constructions with known results gives randomized consensus for arbitrarily many possible input values using unit-cost snapshots in O(log* n) expected steps and randomized consensus for up to O(log n log log n) possible input values using ordinary registers in O(log log n) expected steps.