[infinispan-dev] Distributed hashing - heterogenous nodes

[Manik Surtani]

On 27 May 2009, at 12:48, Vladimir Blagojevic wrote:

> Are you referring to a third strategy? I don't understand how do you  
> assign these tokens to partitions? Any way you want?

Well, you define how many tokens a node participates in.  For example,  
in a CH ring, at the moment each node takes 1 place.

I am suggesting that each node takes N places based on its "weighting".

>
>
> On 5/26/09 3:23 PM, Manik Surtani wrote:
>> This is based on a question that came up when discussing Infinispan  
>> with the Red Hat MRG group.  My current design treats nodes as  
>> equal, and as such would get an equal number of keys mapped to the  
>> node.
>>
>> This is not always desirable, since nodes aren't always equal.   
>> Nodes could be weighted.  Inspired by Amazon's Dynamo paper [1],  
>> I'm considering providing an alternate ConsistentHash  
>> implementation that supports weights, with the use of "virtual  
>> nodes", or "tokens".
>>
>> I suppose the purpose of this email is, do we need a "simplistic"  
>> CH implementation like the one I have right now, anymore?  Should  
>> we not just ship a weighted CH, with the default weight being equal?
>>
>> Cheers
>> Manik
>>
>> [1] http://www.allthingsdistributed.com/2007/10/amazons_dynamo.html
>>
>> -- 
>> 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
>
> _______________________________________________
> infinispan-dev mailing list
> infinispan-dev at lists.jboss.org
> https://lists.jboss.org/mailman/listinfo/infinispan-dev

--
Manik Surtani
manik at jboss.org
Lead, Infinispan
Lead, JBoss Cache
http://www.infinispan.org
http://www.jbosscache.org