[concurrency-interest] Is lock-free list useful?

Martin Buchholz martinrb at google.com
Wed Mar 3 11:30:05 EST 2010

I've been working on the easier problem of lock-free deque.
which I hope to get into jdk7.  It supports interior removals
and does not allocate new Nodes for pointer manipulation.


On Wed, Mar 3, 2010 at 00:55, James Gan <ganzhi at gmail.com> wrote:
> Hi, dear all
> I'm feeling interesting that there is no lock-free list in the j.u.c
> package. Is there a reason behind this? The algorithm of lock-free
> list is pretty simple. And list is a very useful data structure.
> --
> Best Regards
> James Gan
> Current Project: Concurrent Building Block at http://amino-cbbs.sourceforge.net/
> Blog: http://ganzhi.blogspot.com
> _______________________________________________
> Concurrency-interest mailing list
> Concurrency-interest at cs.oswego.edu
> http://cs.oswego.edu/mailman/listinfo/concurrency-interest

More information about the Concurrency-interest mailing list