[infinispan-dev] What's behind the data containers: implementing a performant, thread-safe ordered data container

[Christian Vest Hansen]

Interesting read. It's a concurrent hash-map of sorts, but one that
can be efficiently traversed by insertion order?

One thing that was a bit confusing, is when you seemingly mention
segment locking in the context of a lock-free data structure. Perhaps
reads are lock-free but writes are protected by a striped locking
scheme?

Anyways, it's nice to witness this attension to concurrent performance
and to read about an interesting datastructure :)

On Tue, May 12, 2009 at 5:15 PM, Manik Surtani <manik at jboss.org> wrote:
> Discussing the internals behind data containers in Infinispan.
>
>
>  http://infinispan.blogspot.com/2009/05/implementing-performant-thread-safe.html
>
> Enjoy!
>
> --
> Manik Surtani
> manik at jboss.org
> Lead, Infinispan
> Lead, JBoss Cache
> http://www.infinispan.org
> http://www.jbosscache.org
>
>
>
>
> _______________________________________________
> infinispan-dev mailing list
> infinispan-dev at lists.jboss.org
> https://lists.jboss.org/mailman/listinfo/infinispan-dev
>



-- 
Venlig hilsen / Kind regards,
Christian Vest Hansen.