In computer science, compare-and-swap (CAS) is an atomic instruction used in multithreading to achieve synchronization. It compares the contents of a memory...

Double compare-and-swap (DCAS or CAS2) is an atomic primitive proposed to support certain concurrent programming techniques. DCAS takes two not necessarily...

point of the counter built on compare-and-swap is the linearization point of the first (and only) successful compare-and-swap update. The counter built using...

restored. As such, an LL/SC pair is stronger than a read followed by a compare-and-swap (CAS), which will not detect updates if the old value has been restored...

automatic garbage collection. Any lock-free data structure that uses the compare-and-swap primitive must deal with the ABA problem. For example, in a lock-free...

of atomic operations (such as test-and-set, fetch-and-add, and compare-and-swap) that both read a memory location and write a new value into it simultaneously...

linked list in shared memory using synchronization primitives: Compare-and-swap Fetch-and-add Load-link/store-conditional Several strategies for implementing...

scalable lock-free stack utilizing the fine-grained concurrency primitive compare-and-swap. It is believed that R. Kent Treiber was the first to publish it in...

to the quantity being considered. For example, an algorithm using compare and swap on a pointer might use the low bits of the address to indicate how...

contrast, compare-and-swap (32-bit comparand) offers a more general solution to this problem, and in some implementations compare-double-and-swap (64-bit...