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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
One of important and difficult issues in power saving is how to determine the most appropriate sleep window timing and size for… 
2011
2011
2003
2003
Almost all previous dynamic-sized lock-free data structures are either unable to free memory to the memory allocator when it is… 
2002
2002
We present a lock-free implementation of a dynamically sized double-ended queue (deque) that is based on the double compare-and… 
2002
2002
Abstract.The computer industry is currently examining the use of strong synchronization operations such as double compare-and… 
2002
2002
Almost all previous dynamic-sized lock-free data structures are either unable to free memory to the memory allocator when it is… 
Highly Cited
2001
Highly Cited
2001
Abstract. Assuming the existence of garbage collection makes it easier to design implementations of dynamic-sized concurrent data… 
Highly Cited
2000
Highly Cited
2000
The computer industry is currently examining the use of strong synchronization operations such as double compare-and-swap (DCAS… 
Highly Cited
2000
Highly Cited
2000
The computer industry is examining the use of strong synchronization operations such as double compare-and-swap (DCAS) as a means… 
1998
1998
  • 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…