Strongly Linearizable Implementations of Snapshots and Other Types

DOI10.1145/3293611.3331632OpenAlexW2963266914MaRDI QIDQ5145201FDOQ5145201

Authors: Sean Ovens, Philipp Woelfel 

Publication date: 20 January 2021

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

Full work available at URL: https://arxiv.org/abs/1908.10826

Recommendations

• Strongly linearizable implementations, possibilities and impossibilities
• Wait-freedom is harder than lock-freedom under strong linearizability
• Linearizable implementations do not suffice for randomized distributed computation
• Linear-time snapshot implementations in unbalanced systems
• Are shared objects composable under an oblivious adversary?

zbMATH Keywords

distributed algorithmsshared memorylock-freedomsnapshotsstrong linearizabilityABA

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cited In (1)

• Intermediate value linearizability: a quantitative correctness criterion

This page was built for publication: Strongly Linearizable Implementations of Snapshots and Other Types

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