Talk:Non-blocking linked list

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).

Should we mention DCAS(https://en.wikipedia.org/wiki/Double_compare-and-swap)
DCAS makes this trivial, but is rarely supported. This might be worth mentioning as a heavy-handed hardware fixDCAS — Preceding unsigned comment added by Rsaxvc (talk • contribs) 03:40, 13 April 2017 (UTC)