A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
On achieving consensus using a shared memory
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Bounded polynomial randomized consensus
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Fast randomized consensus using shared memory
Journal of Algorithms
Optimal time randomized consensus—making resilient algorithms fast in practice
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Time- and space-efficient randomized consensus
Journal of Algorithms
Wait-Free Consensus Using Asynchronous Hardware
SIAM Journal on Computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
The expected advantage of asynchrony
Journal of Computer and System Sciences
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
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
Real-time object sharing with minimal system support
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Time-Adaptive Algorithms for Synchronization
SIAM Journal on Computing
Efficient asynchronous consensus with the weak adversary scheduler
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Lower bounds for distributed coin-flipping and randomized consensus
Journal of the ACM (JACM)
Computer architecture (2nd ed.): a quantitative approach
Computer architecture (2nd ed.): a quantitative approach
Analysis of timing-based mutual exclusion with random times
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The statistical adversary allows optimal money-making trading strategies
Proceedings of the sixth 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
Wait-Free Synchronization in Quantum-Based Multiprogrammed Systems
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Conditions on input vectors for consensus solvability in asynchronous distributed systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
Randomized protocols for asynchronous consensus
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Switched PIOA: parallel composition via distributed scheduling
Theoretical Computer Science - Components and objects
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Hi-index | 0.00 |
It is well known that the consensus problem cannot be solved deterministically in an asynchronous environment, but that randomized solutions are possible. We propose a new model, called noisy scheduling, in which an adversarial schedule is perturbed randomly, and show that in this model randomness in the environment can substitute for randomness in the algorithm. In particular, we show that a simplified, deterministic version of Chandra's wait-free shared-memory consensus algorithm [16] solves consensus in time at most logarithmic in the number of active processes. The proof of termination is based on showing that a race between independent delayed renewal processes produces a winner quickly. In addition, we show that the protocol finishes in constant time using quantum and priority-based scheduling on a uniprocessor, suggesting that it is robust against the choice of model over a wide range.