Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Turek et al. (1992) studied this question.