An Efficient Adaptive Partial Snapshot Implementation

DOI10.1145/3465084.3467939MaRDI QIDQ6201983zbMATH OpenOpenAlexFDO

Authors Philipp Woelfel

Publication date 26 March 2024

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

Full work available at URL http://hdl.handle.net/1880/113478

zbMATH Keywords

asynchronyconcurrencypredecessor objectshared memorysnapshot object

Mathematics Subject Classification ID

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

Cited in

(4)

• A wait-free queue with polylogarithmic step complexity
• Efficient bounded timestamping from standard synchronization primitives
• Strongly linearizable LL/SC from CAS
• MemSnap: a fast adaptive snapshot algorithm for RMWable shared-memory

This page was built for publication: An Efficient Adaptive Partial Snapshot Implementation

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