search

bkarr / libshr

Library of shared memory data structures
MIT License
1 stars 0 forks source link

lock-free queue? #10

Open hoax-killer opened 6 years ago

hoax-killer commented 6 years ago

Hey! Thanks for sharing. I was wondering if there are any implementations of a lock-free linked list or if you are planning on adding one? Thanks

bkarr commented 6 years ago

Personally, I was not planning on adding one as I had no use case for one, and I am not aware of any other project building lock-free data structures in shared memory.

Do you have an example use case? Are you looking for an ordered or unordered list? What operations are you looking for?

hoax-killer commented 6 years ago

I am using the Actor Framework model, where different actors running on different cores on the same machine may want to access an infinite and optimal data structure such as a lock-free linked list. Beyond the standard LL operations such as: add, remove, it would also be great to have another operation that removes upto MAX_BURST nodes in a single operation.

For me personally, the order doesn't matter.

Please let me know if you have any questions, and thanks for the library again!