A demonstration of consistent hashing.
-
Updated
Jul 25, 2024 - Go
A demonstration of consistent hashing.
Zig implementation of MementoHash consistent hashing algorithm.
Example to Simulate Distributed Consistent Hashing
JumpBackHash: Say Goodbye to the Modulo Operation to Distribute Keys Uniformly to Buckets
minimal Consistent Hash Ring implementation in go
Aggregated Highest Random Weight Hashing / Aggregated Rendezvous Hashing
General-purpose header-only consistent hash ring implementation
Java implementations of the most popular and best performing consistent hashing algorithms for non-peer-to-peer contexts.
C++ implementations and benchmark tools for MementoHash, AnchorHash, JumpHash, and PowerConsistentHash
Consistent Hashing Algorithm Package for Scalable Data Distribution
⚡ Fast, minimal memory, consistent hash algorithm
High availability distributed system for a cloud-based shopping list application, using CRDTs and consistent hashing.
concurrent load balancers, go lib,
Consistent Hashing is a distributed hash table algorithm that allows for more efficient remapping of keys to nodes in a distributed system when nodes are added or removed. This implementation is written in Go and provides a basic implementation of consistent hashing.
Rust implementation for consisent hashing
A revamped Google's jump consistent hash
consistent hashing data structure
High performance Ring Consistent Hash implementation
Add a description, image, and links to the consistent-hash-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the consistent-hash-algorithm topic, visit your repo's landing page and select "manage topics."