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.
Cite
CITATION STYLE
APA
Harris, T. L. (2001). A pragmatic implementation of non-blocking linked-lists. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2180, pp. 300–314). Springer Verlag. https://doi.org/10.1007/3-540-45414-4_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free