concurrent linked list

Question

I am trying to design a linked list in c++ that allows concurrent access. Clearly using a single lock for this list is grossly inefficient since disjoint areas may be updated in

Answer 1

Linked lists are inherently sequential data structures. No matter what kind of machinery you use to implement it, the interface and expected behavior imply sequential logic.

What are you trying to do? That should determine what data structure you use, not the familiarity of the data structures you already are comfortable with.