Strongly linearizable implementations, possibilities and impossibilities

DOI10.1145/2332432.2332508zbMATH Open1301.68121OpenAlexW2079968340MaRDI QIDQ2933816FDOQ2933816

Authors: Maryam Helmi, Lisa Higham, Philipp Woelfel 

Publication date: 5 December 2014

Published in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

Recommendations

• Wait-freedom is harder than lock-freedom under strong linearizability
• Linearizable implementations do not suffice for randomized distributed computation
• Are shared objects composable under an oblivious adversary?
• Eventually linearizable shared objects
• Randomized consensus with regular registers

zbMATH Keywords

randomizationobstruction-freewait-freelinearizabilitynon-blockingstrong linearizability

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15) Distributed systems (68M14)

Cited In (7)

• Sub-core solutions of the problem of strong implementation
• Concurrent use of write-once memory
• Title not available (Why is that?)
• Putting strong linearizability in context: preserving hyperproperties in programs that use concurrent objects
• Are shared objects composable under an oblivious adversary?
• Wait-freedom is harder than lock-freedom under strong linearizability
• Randomized consensus with regular registers

This page was built for publication: Strongly linearizable implementations, possibilities and impossibilities

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