Re: [infinispan-dev] Collocated nodes
Manik,
I believe this is going to work as well. As long as hash is placing nodes to same
positions in subsequent views and we deterministically devise the neighbour picking
algorithm we should be fine. Your suggestion indeed seems elegant and simple.
Cheers,
Vladimir
On 2010-09-27, at 12:05 PM, Manik Surtani wrote:
Perhaps even a simpler idea would be to naively place nodes on the hash wheel, and when
you need to select nodes as hosts, pick the first one as usual, and for subsequent nodes,
walk clockwise and pick nodes, discarding them if they have the same rack id and machine
id. Once you cycle back to the first node selected, repeat but this time discarding only
for a machine id match. And again, if you cycle back to the first node selected,
don't discard any nodes, regardless of machine id/rack id match.
Thoughts?