Linearizable implementations do not suffice for randomized distributed computation
From MaRDI portal
Publication:5419107
DOI10.1145/1993636.1993687zbMath1288.68027OpenAlexW1982100000MaRDI QIDQ5419107
Lisa Higham, Philipp Woelfel, Wojciech Golab
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993636.1993687
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items
On atomic registers and randomized consensus in m\&m systems, Tight Bounds for Asynchronous Renaming, The correctness proof of Ben-Or's randomized consensus algorithm, The limits of helping in non-volatile memory data structures, Randomized mutual exclusion with sub-logarithmic RMR-complexity, Faster randomized consensus with an oblivious adversary, Randomized consensus with regular registers, Sub-logarithmic Test-and-Set against a Weak Adversary
