python-memcached server selection code (long)

Robert Szefler robert.szefler at sensisoft.com
Thu Oct 25 14:25:39 UTC 2007


Jeremy Dunck napisał(a):
> On 10/25/07, Robert Szefler <robert.szefler at sensisoft.com> wrote:
>   
>> Brian Beuning napisał(a):
>>     
> ...
>   
>>> With any hashing algorithm, it is always possible your
>>> application uses keys that cause the hash to be unfair.
>>>
>>>       
>> This is not a matter of being fair. In fact, the algorithm is fair and,
>> from a certain point of view, it is too fair. A solution to my problem
>> would be to guarantee that potentially every server gets tried in a
>> round and at the same time the query is random and fair in a sense.
>> Which brings us to the random permutation solution I proposed.
>>
>>     
>
> Perhaps interesting to you:
> http://lists.danga.com/pipermail/memcached/2007-August/005099.html
>   

 From what I read here: 
http://www.last.fm/user/RJ/journal/2007/04/10/392555/

Interesting, yes. Related to the problem I exposed, marginally. Solving 
it - definitely not.


More information about the memcached mailing list