Non-blocking algorithm

Known as: Wait-free algorithms, Lock free, Lock free algorithms 
In computer science, an algorithm is called non-blocking if failure or suspension of any thread cannot cause failure or suspension of another thread… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
We describe a non-blocking concurrent hash trie based on shared-memory single-word compare-and-swap instructions. The hash trie… (More)
  • figure 3
  • figure 5
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2010
Highly Cited
2010
This paper describes the first complete implementation of a non-blocking binary search tree in an asynchronous shared-memory… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
A concurrent data-structure implementation is considered non-blocking if it meets one of three following liveness criteria: wait… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We introduce the hash-merge join algorithm (HMJ, for short); a new nonblocking join algorithm that deals with data items from… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We present a new non-blocking implementation of concurrent linked-lists supporting linearizable insertion and deletion operations… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
As mobile computing requires more computation as well as communication activities, energy efficiency becomes the most critical… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
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
1996
Highly Cited
1996
Non-blocking synchronization has significant advantages over blocking synchronization: however, it has not been used to a… (More)
  • figure 2
  • figure 4
  • figure 6
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper discusses the relationship between the Non-Blocking Atomic Commitment problem (NB-AC) and the Consensus problem in… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Non-blocking loads are a very effective technique for tolerating the cache-miss latency on data cache references. In this paper… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?