On 4 Apr 2011, at 11:01, Olaf Bergner wrote:
>
> What we somehow need to avoid is chunks ending up in nodes that do not
> have enough memory to store them, and that could complicate things.
Definitely. What about replication, for instance? Does INFINISPAN use the replication
mechanism suggested by Dynamo, i.e. walking the constant hash ring in clockwise direction
until the desired number of replicas is reached (if I recall correctl)? I'm afraid
this might fail in our case.
Yes, this is how Infinispan's distribution works. Just for clarification, we refer to
this as distribution rather than replication.
On the other hand, when we speak of replication, we mean copies are repliciated to ALL
other nodes in the cluster. I.e., each node is a replica of its neighbour, and all nodes
are treated equal. Replication, as such, has no need for a consistent hash wheel.
Why do you feel this may fail?
Plus, I fear rehashing would have to be aware of wheter it is dealing
with relocating a large object chunk or a "regular" value.
Again, why is this the case?
Cheers
Manik
--
Manik Surtani
manik(a)jboss.org
twitter.com/maniksurtani
Lead, Infinispan
http://www.infinispan.org