Efficient Lock-Free Durable Sets — mentioned by scott_s

Thu, 05 Dec 2019 14:41:58 GMT

Lock-free data structures tend to use the compare-and-swap atomic operation as a primitive: https://en.wikipedia.org/wiki/Compare-and-swap You provide three values to a CAS operation: the memory address you want to change, the value you expect to be there and the new value you want to be there. If the expected value is not what is at that memory address, the CAS fails; presumably, the expected value is not there because another thread's CAS succeeded before you. You now need to do try again (and maybe do some more work before doing so). You can see this in Section 3.3, "The insert operation"…

Paper and discussion history. A mention is not an endorsement.

Efficient Lock-Free Durable Sets · HackerPapers discussions

Efficient Lock-Free Durable Sets — mentioned by scott_s