⚡ Fast, minimal memory, consistent hash algorithm
-
Updated
Jan 1, 2024 - Go
⚡ Fast, minimal memory, consistent hash algorithm
A revamped Google's jump consistent hash
concurrent load balancers, go lib,
Aggregated Highest Random Weight Hashing / Aggregated Rendezvous Hashing
consistent hashing paper implementation using Red Black tree
consistent hashing data structure
High availability distributed system for a cloud-based shopping list application, using CRDTs and consistent hashing.
In-memory immutable wait-free consistent hashing ring data structure, supporting virtual nodes & replication.
grpclb policy that consistent hash implemention, base on discovery systems like etcd, consul etc.
minimal Consistent Hash Ring implementation in go
A demonstration of consistent hashing.
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.
Golang 's implementation of consistent hashing algorithm using hash ring, which is thread-safe, and can be used concurrently.
A simple and fast consistent hash-ring for go
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."