%0 Conference Paper %1 Harris:2001:PIN %A Harris, Timothy L. %B Proceedings of the 15th International Conference on Distributed Computing %C London, UK %D 2001 %I Springer %K LinkedList LockFree %P 300--314 %R 10.1007/3-540-45414-4_21 %T A Pragmatic Implementation of Non-blocking Linked-Lists %X We present a new non-blocking implementation of concurrent linked-lists supporting linearizable insertion and deletion operations. The new algorithm provides substantial benefits over previous schemes: it is conceptually simpler and our prototype operates substantially faster. %@ 3-540-42605-1

@inproceedings{Harris:2001:PIN, abstract = {We present a new non-blocking implementation of concurrent linked-lists supporting linearizable insertion and deletion operations. The new algorithm provides substantial benefits over previous schemes: it is conceptually simpler and our prototype operates substantially faster.}, acmid = {676105}, added-at = {2017-04-16T22:37:44.000+0200}, address = {London, UK}, author = {Harris, Timothy L.}, biburl = {https://www.bibsonomy.org/bibtex/2330df2ba58dc5aed2ff1d8d7f1f07358/gron}, booktitle = {Proceedings of the 15th International Conference on Distributed Computing}, description = {A Pragmatic Implementation of Non-blocking Linked-Lists}, doi = {10.1007/3-540-45414-4_21}, interhash = {10e170c24e487d19a06baf3d0c168543}, intrahash = {330df2ba58dc5aed2ff1d8d7f1f07358}, isbn = {3-540-42605-1}, keywords = {LinkedList LockFree}, numpages = {15}, pages = {300--314}, publisher = {Springer}, series = {DISC '01}, timestamp = {2017-04-16T22:37:44.000+0200}, title = {{A Pragmatic Implementation of Non-blocking Linked-Lists}}, year = 2001 }