Consistent hashing
Consistent hashing maps keys to a changing set of nodes or partitions while minimizing key reassignment when destinations are added or removed.
Elixir in Action, Third Edition
Consistent hashing is a key-to-node mapping technique that limits remapping when nodes are added to or removed from a distributed system.
- How it is used
- Reduces key remapping and data migration in distributed caches when cluster membership changes.
- How deep it goes
- Defines the operational benefit but stops short of implementing the hashing algorithm or migration procedure.
- Examples
- Uses a to-do cache that hashes list names onto sorted visible nodes before issuing a remote cache call.
- What you can do after
- Evaluate when a simple key-to-node mapping should give way to a more scalable, change-resistant approach.
Read how Elixir in Action, Third Edition explains consistent hashing →
Akka in Action, Second Edition
Consistent hashing is a hashing algorithm that assigns keys to a changing set of nodes while minimizing key reassignment when nodes are added or removed.
- How it is used
- Keeps related messages on the same routee when distributed workers must combine results reliably.
- How deep it goes
- Explains deterministic key-based routing and shows Akka configuration, while treating detailed router steps as internal.
- Examples
- Uses obfuscation, enrichment, aggregation, message identifiers, and an Akka group-router configuration.
- What you can do after
- Apply it via an Akka group router by defining a message-key mapping and consistent-hashing routee strategy.
Read how Akka in Action, Second Edition explains consistent hashing →
Also covered in
- Designing AI SystemsIn early access (MEAP)
- Advanced Algorithms and Data Structures
- Think Distributed Systems
- Amazon Web Services in Action, Third Edition: An in-depth guide to AWS
What to know first
- scalabilityScalability is the ability of a system or process to accommodate growth in workload, size, or demand while maintaining acceptable operation.
Related concepts
- A/B testused by · An A/B test is a controlled experiment that compares outcomes for two variants assigned to different users or experimental units.
- distributed cachingused by · Distributed caching is a technique for storing cached data across networked nodes so it can be accessed by multiple processes or application instances.
- hash functionuses · A hash function is a deterministic function that maps input data to a hash value, typically of fixed size, for uses such as lookup, indexing, comparison, or integrity checking.
- dataset splitused by · A dataset split is the division of a dataset into distinct subsets assigned different purposes, such as training, validation, or evaluation.
- experimentation-as-a-service platformused by · An experimentation platform is software infrastructure for assigning users or traffic to variants, delivering experimental conditions, and measuring outcome differences.
- routingaddresses · Routing is the process of directing an item, request, or task to a destination or processing path according to relevant rules or characteristics.
Questions about consistent hashing
What is consistent hashing?
Consistent hashing maps keys to a changing set of nodes or partitions while minimizing key reassignment when destinations are added or removed.
Which Manning books explain consistent hashing?
Elixir in Action, Third Edition and Akka in Action, Second Edition.
What should I know before learning consistent hashing?
Manning books that teach consistent hashing usually introduce scalability first.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.

