Polylog randomized wait-free consensus

DOI10.1145/248052.248083MaRDI QIDQ2942729zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(15)

• Efficient execution of nondeterministic parallel programs on asynchronous systems
• Task-structured probabilistic I/O automata
• 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
• Randomized consensus with regular registers
• Communication-efficient randomized consensus
• Tight bounds for adopt-commit objects
• Fault-tolerant consensus with an abstract MAC layer
• Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
• Randomized protocols for asynchronous consensus
• Faster randomized consensus with an oblivious adversary
• Switched PIOA: parallel composition via distributed scheduling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942729)