Are shared objects composable under an oblivious adversary?

DOI10.1145/2933057.2933115MaRDI QIDQ5361952zbMATH OpenOpenAlexFDO

Authors Oksana Denysyuk, Philipp Woelfel

Publication date 29 September 2017

Published in Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

distributed algorithmslinearizabilityrandomized algorithmsshared memory

Mathematics Subject Classification ID

Distributed algorithms (68W15) Randomized algorithms (68W20)

Recommendations

• Linearizable implementations do not suffice for randomized distributed computation
• Strongly linearizable implementations, possibilities and impossibilities
• Wait-freedom is harder than lock-freedom under strong linearizability
• Faster randomized consensus with an oblivious adversary
• Faster randomized consensus with an oblivious adversary

Cited in

(6)

• Wait-freedom is harder than lock-freedom under strong linearizability
• What Information Is Leaked under Concurrent Composition?
• Strongly linearizable implementations, possibilities and impossibilities
• Strongly Linearizable Implementations of Snapshots and Other Types
• Linearizable implementations do not suffice for randomized distributed computation
• Faster randomized repeated choice and DCAS

This page was built for publication: Are shared objects composable under an oblivious adversary?

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