Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Compare-and-swap

Known as: Compare and exchange, Compare-and-set, CAS 
In computer science, compare-and-swap (CAS) is an atomic instruction used in multithreading to achieve synchronization. It compares the contents of a… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Multithreaded software is typically built with specialized concurrent objects like atomic integers, queues, and maps. These… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap… Expand
  • table 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In voting theory, bribery is a form of manipulative behavior in which an external actor (the briber) offers to pay the voters to… Expand
  • table 1
Is this relevant?
2008
2008
The current literature offers two extremes of nonblocking software synchronization support for concurrent data structure design… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 7
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We present a novel “lazy” list-based implementation of a concurrent set object. It is based on an optimistic locking scheme for… Expand
  • figure 2
  • figure 3
  • figure 5
  • figure 7
  • figure 8
Is this relevant?
2007
2007
The compare-and-swap register (CAS) is a synchronization primitive for lock-free algorithms. Most uses of it, however, suffer… Expand
  • figure 4.1
Is this relevant?
2004
2004
We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Work on non-blocking data structures has proposed extending processor designs with a compare-and-swap primitive, CAS2, which acts… Expand
  • figure 2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Lock-free data structures implement concurrent objects without the use of mutual exclusion. This approach can avoid performance… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 9
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Nonblocking algorithms for concurrent objects guarantee that an object is always accessible, in contrast to blocking algorithms… Expand
Is this relevant?