Strongly Linearizable Implementations of Snapshots and Other Types

DOI10.1145/3293611.3331632MaRDI QIDQ5145201zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

ABAdistributed algorithmslock-freedomshared memorysnapshotsstrong linearizability

Mathematics Subject Classification ID

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

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?

Cited in

(5)

• Intermediate value linearizability: a quantitative correctness criterion
• Preserving hyperproperties of programs using primitives with consensus number 2
• Strongly linearizable LL/SC from CAS
• Strong linearizability using primitives with consensus number 2
• 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)