Lock Free Data Structures Book, The compare-and-swap (CAS) operation is crucial for implementing lock-free algorithms.

Lock Free Data Structures Book, Universal methods for constructing lock-free data structures for any abstract data type are known, but the resulting implementations are much less efficient than using conventional techniques for mutual exclusion such as spin locks. Universal methods for constructing lock-free data structures for any abstract data type are known, but the resulting implementations are much less efficient than using conventional techniques for mutual exclusion such as spin locks. A collection of resources on wait-free and lock-free programming - rigtorp/awesome-lockfree Implement a lock segmenting version of lock-free fine-grained locking on a vector data structure using atomic arrays, not mutexes (see discussion of “lock segmenting” in Chapter 4). . Designing lock-free data structures If at least one thread is guaranteed to make progress, then we say it's a lock-free function. Compared to lock-based functions, where one thread Lock-free data structures provide significant advantages over lock-based structures, including thread progress guarantees. The compare-and-swap (CAS) operation is crucial for implementing lock-free algorithms. Keir Fraser's dissertation, Practical lock freedom, presents a large number of new designs for concurrent data structures such as skip-lists, red-black trees and binary search trees, including new lock-based designs as well as lock-free versions. A collection of lock-free data structures written in standard C++11 - DNedic/lockfree A collection of resources on wait-free and lock-free programming - rigtorp/awesome-lockfree Implement a lock segmenting version of lock-free fine-grained locking on a vector data structure using atomic arrays, not mutexes (see discussion of “lock segmenting” in Chapter 4). x2g, 3ynm, hffzju, fahup2, mo, chhf, p7, apcz, 5zkusflu, akerj,