Hi Tim, unfortunately I don't have time to port it either, but if someone is interested it should be a straight-forward port provided that c++11-style atomics and thread-local variables are available. I should note that in my lib all atomic loads/stores are relaxed by default (rather than seq_cst). On 07/10/2011 4:12 AM, Tim Blechmann wrote:
hi dan,
The general interest was to have a more diverse set of data structures available, such as a lock-free linked list or bounded and fixed-sized data structures. I've been sitting on a lock-free doubly-linked list, perhaps there's interest in porting it to boost. It's ABA problem free using only a 32-bit CAS. It's built off of a lock-free memory manager that could serve as the foundation for other container types (map, unordered map, bag).
The doubly-linked list, algorithm supports parallelism for disjoint accesses so contention can decrease as the list size increases: i currently wouldn't have any time to port it to boost.lockfree (especially since it seems to use rather different concepts than the ones that i have implemented for now it would probably need some adaptions) ... but i will try to assist you, if you want to try to integrate it into boost.lockfree.
iac, maybe i can find the time to read the specific papers in the next few days ...
cheers, tim