Skip to search formSkip to main contentSkip to account menu

Double compare-and-swap

Known as: Dual Operand Compare and Swap, Dual compare-and-swap, Dual Compare and Swap 
Double compare-and-swap (DCAS or CAS2) is an atomic primitive proposed to support certain concurrent programming techniques. DCAS takes two not… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Compare-and-swapDoubly linked listLoad-link/store-conditionalProcessor supplementary capability

Broader (1)

Concurrency control

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Almost overhead-free dynamic sleep window adjusting policy for mobile communication systems
One of important and difficult issues in power saving is how to determine the most appropriate sleep window timing and size for… 
2003
2003
Brief Announcement: Dynamic-Sized Lock-Free Data Structures∗
Almost all previous dynamic-sized lock-free data structures are either unable to free memory to the memory allocator when it is… 
2002
2002
DCAS-based concurrent deques supporting bulk allocation
We present a lock-free implementation of a dynamically sized double-ended queue (deque) that is based on the double compare-and… 
1998
1998
Consistency conditions for multi-object distributed operations
  • N. MittalV. Garg
  • Proceedings. 18th International Conference on…
  • 1998
  • Corpus ID: 14876771
The traditional distributed shared memory (DSM) model provides atomicity at levels of read and write on single objects. Therefore… 
1998
1998
Consistency Conditions for Multi-object Distributed Operations Neeraj Mittal
The traditional Distributed Shared Memory (DSM) model provides atomicity at levels of read and write on single objects. Therefore… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)