Computer Science Visiting Speaker Talk

— 3:00pm

Reddy Conference Room 4405 - Gates Hillman Centers


I plan to present two recent algorithms for consistent and non-consistent load-balancing.

First, consistent hashing is a key building block in many networking applications, from datacenter load-balancing to distributed storage. Unfortunately, existing consistent-hashing techniques do not seem to scale. I will introduce a consistent hashing algorithm that achieves a key lookup rate of 15 million keys per second on a single laptop core while scaling to 100 million servers.

Second, I consider non-consistent load-balancing. I present Persistent-Idle, a novel counter-intuitive algorithm: when all servers are busy, it just keeps sending all traffic to a single unlucky server instead of load-balancing. Somehow, it performs better as a load-balancer than many algorithms in the wild. I will wonder why aloud.

For More Information:

Add event to Google
Add event to iCal