Talk:Non-blocking linked list
{{WikiProject banner shell|class=|
{{WikiProject Computer science}}
}}
Note
The significant point is first the atomicity of certain operations (effectively a pseudo-lock) and secondly the algorithmic implementations, and the speed benefit they bring. All the best: Rich Farmbrough, 02:22, 29 November 2014 (UTC).
:Also of interest Split-Ordered Lists: Lock-Free Extensible Hash Tables by Ori Shalev and Nir Shavit.
:All the best: Rich Farmbrough, 02:59, 29 November 2014 (UTC).