Consistent hashing is a distributed systems technique that operates by assigning the data objects and nodes a position on a virtual ring structure (hash ring). Consistent hashing minimizes the number of keys to be remapped when the total number of nodes changes This can be used to consistently route requests to one of pool of servers
Consistent hashing algorithm
from NK
Filed under:
Related Notes
- In Eliyahu M. Goldratt's "Theory of Constraints", you...from ycombinator.com
- Nathan's four Laws of Software: 1. **Software is a gas** ...from Jeff Atwood
- > Software with fewer concepts composes, scales, and evolves mor...from oilshell
- few days ago I did something that I never thought I’d do again, and...from brandur.org
- Amdahl's law is often used in [parallel computing](https://en.w...from en.wikipedia.org
- But the thing about state-sponsored attacks is that they’re a bit l...from Matt Webb
- [CAP theorem](https://en.wikipedia.org/wiki/CAP_theorem) is perhaps...from apenwarr.ca
- as devices get extremely fast, interrupt-driven work is no longer a...from Glauber Costa