The power of two random choices (2012)
brooker.co.za
The power of two random choices (2012)
1–10 of 12 posts
Re: The power of two random choices (2012)
#2Amazing technique. Previous submissions, and another good one on load balancing via PoTRC
https://news.ycombinator.com/item?id=39283595 https://news.ycombinator.com/item?id=24877341 https://news.ycombinator.com/item?id=37143376
Re: The power of two random choices (2012)
#3Re: The power of two random choices (2012)
#4Re: The power of two random choices (2012)
#5(2012) Amazing technique. Previous submissions, and another good one on load balancing via PoTRC https://news.ycombinator.com/item?id=39283595 https://news.ycombinator.com/item?id=24877341 https://news.ycombinator.com/item?id=37143376
Re: The power of two random choices (2012)
#6Re: The power of two random choices (2012)
#7neat trick indeed. would be cool to do the math and get an analytical formula of mean queue time given cache refresh for a given k, under some mild assumptions.
I'm more confident that that paper established that firing n requests at n servers will result in a max server load proportional to log(log(n)) with high probability, vs. proportional to log(n) for random -- IOW an exponential improvement in max server load over random.
Re: The power of two random choices (2012)
#8Re: The power of two random choices (2012)
#9Re: The power of two random choices (2012)
#10I found less-than-great results in a simulation where there's a slight persistent difference between two of the options: https://www.brainonfire.net/blog/2019/07/21/load-balancing-b... (as part of a larger study on healthchecks that Don't Suck).