Polylog randomized wait-free consensus

DOI10.1145/248052.248083zbMath1321.68066OpenAlexW2049066374MaRDI QIDQ2942729

Tushar Deepak Chandra

Publication date: 11 September 2015

Published in: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/248052.248083

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (15)

Switched PIOA: parallel composition via distributed scheduling ⋮ Efficient execution of nondeterministic parallel programs on asynchronous systems ⋮ A modular approach to shared-memory consensus, with applications to the probabilistic-write model ⋮ Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler ⋮ On the importance of having an identity or, is consensus really universal? ⋮ Relationships between broadcast and shared memory in reliable anonymous distributed systems ⋮ Anonymous and fault-tolerant shared-memory computing ⋮ Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study ⋮ Randomized protocols for asynchronous consensus ⋮ Tight bounds for adopt-commit objects ⋮ Task-structured probabilistic I/O automata ⋮ Faster randomized consensus with an oblivious adversary ⋮ Randomized consensus with regular registers ⋮ Fault-Tolerant Consensus with an Abstract MAC Layer. ⋮ Communication-efficient randomized consensus

This page was built for publication: Polylog randomized wait-free consensus