Open Stack

On 17/04/17 12:09 PM, gordon chung wrote:
> i tried also to implement jump hash[2], which improved distribution and
> is in theory, less memory intensive as it does not maintain a hash
> table. while better at distribution, it still is not completely uniform
> and similarly, the less sacks per worker, the worse the distribution.

hmm... may have spoke incorrectly on this one, it's better but i don't 
think we can use it to assign sacks to processing workers. i think it's 
only usable for assigning metrics into sacks.

cheers,

-- 
gord