Faster randomized repeated choice and DCAS

DOI10.1145/3662158.3662828MaRDI QIDQ6971915zbMATH OpenFDO

Authors Dante Bencivenga, George Giakkoupis, Philipp Woelfel

Publication date 13 June 2025

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

zbMATH Keywords

DCASdouble-compare-and-swaprandomized algorithmsrepeated choiceshared memory

Mathematics Subject Classification ID

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

Cites work

• Are shared objects composable under an oblivious adversary?
• DCAS-based concurrent deques
• Disentangling multi-object operations (extended abstract)
• Disjoint-access-parallel implementations of strong shared memory primitives
• Efficient multi-word compare and swap
• Efficient randomized DCAS
• Highly concurrent multi-word synchronization
• scientific article; zbMATH DE number 2013836 (Why is no real title available?)
• Improved implementations of binary universal operations
• Linearizable implementations do not suffice for randomized distributed computation
• On the Complexity of Certified Write-All Algorithms
• Software transactional memory
• Two-handed emulation, how to build non-blocking implementations of complex data-structures using DCAS
• Universal constructions for multi-object operations

This page was built for publication: Faster randomized repeated choice and DCAS

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