Locking without blocking
John Turek, Dennis E. Shasha, Sundeep Prakash · 1992
Nonblocking algorithms for concurrent data structures guarantee that a data structure is always accessible. This is in contrast to blocking algorithms in which a slow or halted process can render part or all of the data structure inaccessible to other processes.