Paper accepted at STOC 2021: Efficient Randomized DCAS
The paper Efficient Randomized DCAS, a joint work by George Giakkoupis (WIDE), Mehrdad Jafari Giv and Philipp Woelfel (University of Calgary, Canada) has been accepted at the 53rd ACM Symposium on Theory of Computing (STOC 2021). Double-Compare-And-Swap (DCAS) is a tremendously useful shared-memory synchronization primitive, which is also notoriously difficult…