Is it possible to build a thread-safe linked list that scales and provides read, insert and remove?

Asked Feb 10 '14 at 14:45

Active Mar 15 '15 at 15:54

Viewed 146 times

I've been looking for implementations of scalable linked-lists that can be used safely my multiple threads in parallel, that can read, insert and remove elements from it.

However, I was only able to found papers and theoretical descriptions of them, no libraries are available.

First of all, it is mandatory to use intrinsics or can I do this with higher-level atomics (e.g. OpenMP atomic)? Will that hurt scalability?

In second place, implementations usually provide insert and remove functions. The only way to traverse the list in another thread and at the same time is me to implement it, right?

Thanks

edited Mar 15 '15 at 15:54

asked Feb 10 '14 at 14:45

a3mlord

1,060
6
16

Did you read the thread here: http://stackoverflow.com/questions/19609417/atomic-operations-for-lock-free-doubly-linked-list – user1767754 Feb 10 '14 at 14:52
If you have a Haswell CPU you can use [TSX](http://en.wikipedia.org/wiki/Transactional_Synchronization_Extensions) for all that, in theory that should be the best performance and scalability. – Leeor Feb 10 '14 at 14:57
@user1767754, that thread doesn't answer my questions. – a3mlord Feb 10 '14 at 18:20
@Leeor, thanks, but I have Sandy Bridge processors only. :-( – a3mlord Feb 10 '14 at 18:21
See [this library](http://libcds.sourceforge.net/) – Pavel Davydov Feb 14 '14 at 13:29

Is it possible to build a thread-safe linked list that scales and provides read, insert and remove?

0 Answers0