• In computer science, compare-and-swap (CAS) is an atomic instruction used in multithreading to achieve synchronization. It compares the contents of a memory...
    20 KB (2,606 words) - 23:18, 21 February 2024
  • Double compare-and-swap (DCAS or CAS2) is an atomic primitive proposed to support certain concurrent programming techniques. DCAS takes two not necessarily...
    5 KB (736 words) - 12:42, 23 December 2022
  • Thumbnail for Linearizability
    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...
    24 KB (3,292 words) - 01:43, 14 March 2024
  • 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...
    13 KB (1,425 words) - 03:31, 25 June 2024
  • 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...
    3 KB (325 words) - 02:06, 14 February 2024
  • 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...
    4 KB (575 words) - 06:13, 14 June 2024
  • linked list in shared memory using synchronization primitives: Compare-and-swap Fetch-and-add Load-link/store-conditional Several strategies for implementing...
    7 KB (826 words) - 07:38, 7 May 2024
  • 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...
    6 KB (731 words) - 10:18, 17 July 2024
  • 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...
    14 KB (2,102 words) - 06:45, 13 January 2024
  • 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...
    10 KB (1,414 words) - 21:46, 24 July 2023
  • register is used. A compare-and-swap instruction is even provided in some processor architectures, which compares and conditionally swaps two registers. This...
    8 KB (949 words) - 21:32, 9 December 2022
  • Thumbnail for Credit default swap
    A credit default swap (CDS) is a financial swap agreement that the seller of the CDS will compensate the buyer in the event of a debt default (by the debtor)...
    131 KB (15,191 words) - 10:07, 31 July 2024
  • __sync_bool_compare_and_swap built into many Unix compilers. With the optimizations applied, a sample would look like: ; In C: while (!__sync_bool_compare_and_swap(&locked...
    14 KB (1,731 words) - 16:09, 13 July 2024
  • Thumbnail for Bubble sort
    element, comparing the current element with the one after it, swapping their values if needed. These passes through the list are repeated until no swaps have...
    19 KB (2,318 words) - 02:32, 22 June 2024
  • (1991) proved that fetch-and-add has a finite consensus number, in contrast to the compare-and-swap operation. The fetch-and-add operation can solve the...
    7 KB (870 words) - 07:29, 5 June 2024
  • single memory word, and compare-and-swap, which swaps the contents of two memory words. In Java, one way to prevent thread interference and memory consistency...
    19 KB (2,392 words) - 09:08, 2 July 2024
  • hardware level requires atomic operations such as Test-and-set, Fetch-and-add, Compare-and-swap, or Load-Link/Store-Conditional, together with memory barriers...
    5 KB (606 words) - 13:10, 19 April 2024
  • copy-on-write ("implicitly shared" in Qt's terms). Qt uses atomic compare-and-swap operations to increment or decrement the internal reference counter...
    8 KB (804 words) - 13:37, 26 April 2024
  • access. Some processors have special instructions, like test-and-set or compare-and-swap, which, by locking the memory bus, can be used to provide mutual...
    10 KB (1,126 words) - 18:50, 28 February 2024
  • problem is found for lock-free programs on persistent memory. As compare-and-swap (CAS) operations do not persist the written values to persistent memory...
    7 KB (916 words) - 09:14, 13 March 2023
  • (parallelization and synchronization directives, which can utilize compare-and-swap and fetch-and-add operations on shared memory synchronization variables), and perform...
    16 KB (2,082 words) - 14:14, 25 January 2024
  • Memory paging (redirect from Swap file)
    systems, memory paging (or swapping on some Unix-like systems) is a memory management scheme by which a computer stores and retrieves data from secondary...
    42 KB (5,345 words) - 23:29, 11 July 2024
  • flexible and generic wake mechanism is useful for implementing many synchronization primitives. Synchronization Fetch-and-add Compare-and-swap "Fuss, Futexes...
    8 KB (841 words) - 16:35, 3 June 2024
  • trie based on single-word compare-and-swap instructions in a shared-memory system. It supports concurrent lookup, insert and remove operations. Just like...
    12 KB (1,684 words) - 19:20, 7 June 2023
  • hardware utilization and performance by only requiring log 2 ⁡ ( P ) + 1 {\displaystyle \log _{2}(P)+1} pipeline stages of P/2 compare-and-swap units to merge...
    16 KB (2,087 words) - 07:02, 24 August 2023
  • the Air Staff (disambiguation) Derive computer algebra system Double compare-and-swap Downloadable Conditional Access System New York City Department of...
    352 bytes (74 words) - 14:29, 12 December 2022
  • the median from a sorting network, where each compare-and-swap "wire" is simply an OR gate and an AND gate. The Ajtai–Komlós–Szemerédi (AKS) construction...
    5 KB (639 words) - 09:35, 29 July 2024
  • Thumbnail for X86-64
    for parallel algorithms that use compare and swap on data larger than the size of a pointer, common in lock-free and wait-free algorithms. Without CMPXCHG16B...
    115 KB (11,446 words) - 22:54, 27 July 2024
  • Thumbnail for Bitonic sorter
    extend this representation to a non-power-of-two case (where each compare-and-swap ignores any case where the larger index is out of range). The following...
    9 KB (1,353 words) - 09:34, 16 July 2024
  • Thumbnail for Concurrent hash table
    known as concurrency control. Using atomic instructions such as compare-and-swap or fetch-and-add, problems caused by contention can be reduced by ensuring...
    16 KB (1,777 words) - 20:23, 22 March 2024