On Apr 4, 2011, at 10:09 AM, Galder Zamarreño wrote:
Hi Olaf,
See below for comments:
On Mar 29, 2011, at 12:49 PM, Olaf Bergner wrote:
> </snip>
>
> 3. The design suggests to use a fresh UUID as the key for each new
> chunk. While this in all likelihood gives us a unique new key for each
> chunk I currently fail to see how that guarantees that this key maps to
> a node that is different from all the nodes already used to store chunks
> of the same Large Object. But then again I know next to nothing about
> Infinispan's constant hashing algorithm.
I think there's a service that will generate a key mapped to particular node, so that
might be a better option here to avoid all chunks going to the same node. I think Mircea
might be able to help further with this.
Actually, it's not that simple, it needs to be adaptive but it might be going into the
territory of virtual nodes and sizing of virtual nodes. The key thing of choosing the
nodes to store the chunks is that there should be enough memory in the node where it
lands. IOW, if a 5GB dvd is being chunked into 100MB pieces, it would not make sense
sending chunks to a node that does not have memory to fit that.
>
>
>
> _______________________________________________
> infinispan-dev mailing list
> infinispan-dev(a)lists.jboss.org
>
https://lists.jboss.org/mailman/listinfo/infinispan-dev
--
Galder Zamarreño
Sr. Software Engineer
Infinispan, JBoss Cache
_______________________________________________
infinispan-dev mailing list
infinispan-dev(a)lists.jboss.org
https://lists.jboss.org/mailman/listinfo/infinispan-dev
--
Galder Zamarreño
Sr. Software Engineer
Infinispan, JBoss Cache