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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1976-2017
010203019762017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The number of cores in future multi-core systems are expected to increase by 100 fold over the next decade. The fine-grained… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2014
2014
Many concurrent data-structure implementations – both blocking and non-blocking – use the well-known compare-and-swap (CAS… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • table II
Is this relevant?
2013
2013
Many concurrent data-structure implementations use the well-known compare-and-swap (CAS) operation, supported in hardware by most… (More)
  • figure 1
  • figure 2
  • figure 3
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… (More)
  • figure 3
Is this relevant?
2004
2004
We present an efficient and practical lock-free implementation of a concurrent deque that is disjoint-parallel accessible and… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2003
2003
The current literature o .ers two extremes of nonblocking software synchronization support for concurrent data structure design… (More)
  • figure 1
  • figure 2
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… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 3
Is this relevant?
2000
2000
Many nonblocking algorithms have been proposed for shared queues. Previous studies indicate that link-based algorithms perform… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Drawing ideas from previous authors, we present a new non-blocking concurrent queue algorithm and a new twolock queue algorithm… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
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… (More)
  • figure 8
Is this relevant?