ABA problem

In multithreaded computing, the ABA problem occurs during synchronization, when a location is read twice, has the same value for both reads, and… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1994-2015
012319942015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We investigate the time and space complexity of detecting and preventing ABAs in shared memory algorithms for systems with n… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2011
2011
  • Damian Dechev
  • 7th International Conference on Collaborative…
  • 2011
An increasing number of modern real-time systems and the nowadays ubiquitous multicore architectures demand the application of… (More)
  • figure 4
  • figure 1
  • figure 2
  • figure 3
  • table I
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Lock-free data structures allow concurrent access to the data faster than if the entire structure needs to be locked. One… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2010
2010
An increasing number of modern real-time systems and the nowadays ubiquitous multicore architectures demand the application of… (More)
  • table 1
  • table 2
  • figure 1
  • figure 3
  • figure 2
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?
2006
2006
We present a first lock-free design and implementation of a dynamically resizable array (vector). The most extensively used… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2004
2004
The ABA problem is a fundamental problem that affects almost all lock-free algorithms. The atomic primitives LL/SC/VL (Load… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Lock-free objects offer significant performance and reliability advantages over conventional lock-based objects. However, the… (More)
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Memory reuse in link-based lock-free data structures requires special care. Many lock-free algorithms require deleted nodes not… (More)
  • figure 1
  • figure 3
  • figure 6
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We study practical techniques for implementing the FIFO queue abstract data type using lock-free data structures, which… (More)
  • figure 6
Is this relevant?