[GitHub] sjfink commented on issue #2360: Choose target invoker based on specific invoker load.

[gi...@git.apache.org]

sjfink commented on issue #2360: Choose target invoker based on specific invoker load.
URL: https://github.com/apache/incubator-openwhisk/pull/2360#issuecomment-307815857
 
 
   By my reading, I don't think the hashing based on prime numbers is good.    What we want are not a list of prime numbers, but a list of numbers that are relatively prime to the total number of invokers.
   
   For example:  suppose we have 100 invokers.    "5" is a prime number, but it's not a good step, because 5 is not relatively prime to 100.   (stepping by 5 will not hit all 100 invokers -- only 20 of them.)
   
   On the contrary, "21" is not a prime number, but it is relatively prime to 100.   So 21 is a good step, since stepping by 21 will hit all 100 invokers before coming home.
   
   https://en.wikipedia.org/wiki/Coprime_integers
 
----------------------------------------------------------------
This is an automated message from the Apache Git Service.
To respond to the message, please log on GitHub and use the
URL above to go to the specific comment.
 
For queries about this service, please contact Infrastructure at:
users@infra.apache.org


With regards,
Apache Git Services