Efficient randomized DCAS

DOI10.1145/3406325.3451133MaRDI QIDQ6065247zbMATH OpenFDO

Authors George Giakkoupis, Philipp Woelfel

Publication date 14 November 2023

Published in Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

DCASdouble-compare-and-swapoblivious adversaryrandomized algorithmsshared memory

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(2)

• Faster randomized repeated choice and DCAS
• Strongly linearizable LL/SC from CAS

This page was built for publication: Efficient randomized DCAS

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