Strongly linearizable LL/SC from CAS

DOI10.1145/3662158.3662800MaRDI QIDQ6971917zbMATH OpenFDO

Authors Fatemeh Naderi-Semiromi, Philipp Woelfel

Publication date 13 June 2025

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

zbMATH Keywords

ABALL/SCshared memorystrong linearizabilitywait-freedom

Mathematics Subject Classification ID

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

Cites work

• A polylog time wait-free construction for closed objects
• Adaptive and efficient abortable mutual exclusion
• An Efficient Adaptive Partial Snapshot Implementation
• An optimal multi-writer snapshot algorithm
• Disjoint-access-parallel implementations of strong shared memory primitives
• Distributed Computing – IWDC 2005
• Efficient and practical constructions of LL/SC variables
• Efficient randomized DCAS
• F-arrays, implementation and applications
• scientific article; zbMATH DE number 1263230 (Why is no real title available?)
• scientific article; zbMATH DE number 7832769 (Why is no real title available?)
• Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions
• Linearizable implementations do not suffice for randomized distributed computation
• Ll/SC and atomic copy: constant time, space efficient implementations using only pointer-width CAS
• On the time and space complexity of ABA prevention and detection
• Practical implementations of non-blocking synchronization primitives
• Software transactional memory
• Strongly Linearizable Implementations of Snapshots and Other Types
• Strongly linearizable implementations, possibilities and impossibilities
• Universal constructions for large objects
• Universal constructions for multi-object operations
• Wait-freedom is harder than lock-freedom under strong linearizability

This page was built for publication: Strongly linearizable LL/SC from CAS

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