Efficient asynchronous consensus with the weak adversary scheduler
From MaRDI portal
Publication:5361484
DOI10.1145/259380.259441zbMath1373.68072OpenAlexW1981367703MaRDI QIDQ5361484
Publication date: 29 September 2017
Published in: Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/259380.259441
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Related Items (9)
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? ⋮ Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study ⋮ Hundreds of impossibility results for distributed computing ⋮ Randomized protocols for asynchronous consensus ⋮ Tight bounds for adopt-commit objects ⋮ Faster randomized consensus with an oblivious adversary ⋮ Sub-logarithmic Test-and-Set against a Weak Adversary
This page was built for publication: Efficient asynchronous consensus with the weak adversary scheduler
