On processor coordination using asynchronous hardware
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Fast randomized consensus using shared memory
Journal of Algorithms
Optimal multi-writer multi-reader atomic register
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Wait-Free Consensus Using Asynchronous Hardware
SIAM Journal on Computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Randomized Consensus in Expected O(n log^ 2 n) Operations Per Processor
SIAM Journal on Computing
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
Lower bounds for distributed coin-flipping and randomized consensus
Journal of the ACM (JACM)
On the space complexity of randomized synchronization
Journal of the ACM (JACM)
Cooperative sharing and asynchronous consensus using single-reader single-writer registers
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Randomized Consensus in Expected O(n²log n) Operations
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Verifying Randomized Byzantine Agreement
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
On the Importance of Having an Identity or is Consensus Really Universal?
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Randomized protocols for asynchronous consensus
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Failure detection and consensus in the crash-recovery model
Distributed Computing
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Lower bounds for randomized consensus under a weak adversary
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Using Bounded Model Checking to Verify Consensus Algorithms
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Multi-sided shared coins and randomized set-agreement
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Brief announcement: a shared disk on distributed storage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Tight bounds for anonymous adopt-commit objects
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Lower Bounds for Randomized Consensus under a Weak Adversary
SIAM Journal on Computing
| Hi-index | 0.00 |
We present a randomized algorithm for asynchronous wait-free consensus using multi-writer multi-reader shared registers. This algorithm is based on earlier work by Chor, Israeli and Li (CIL) and is correct under the assumption that processes can perform a random choice and a write operation in one atomic step. The expected total work for our algorithm is shown to be O(N log(logN)), compared with O(N2) for the CIL algorithm, and O(N logN) for the best known weak adversary algorithm. We also model check instances of our algorithm using the probabilistic model checking tool PRISM.