Go consistent hashing library
-
Updated
Mar 16, 2021 - Go
Go consistent hashing library
Aggregated Highest Random Weight Hashing / Aggregated Rendezvous Hashing
General-purpose header-only consistent hash ring implementation
High performance Ring Consistent Hash implementation
Zig implementation of MementoHash consistent hashing algorithm.
An Erlang library for building worker pools using consistent hashing.
UUID Generator that uses Orbis.
Orbis: Example Application
Implementation of jump consistent hashing from From the paper "A Fast, Minimal Memory, Consistent Hash Algorithm" by John Lamping, Eric Veach (2014).
A consistent hashing implementation for .NET.
In-memory immutable wait-free consistent hashing ring data structure, supporting virtual nodes & replication.
A concurrent, lock-free consistent hashing ring implementation in Rust.
consistent hashing paper implementation using Red Black tree
Consistent-hashing: Hash ring implementation in Go
An implementation of Consistent Hashing with Bounded Loads (using Red-Black tree)
A consistent hashing library in Rust
A revamped Google's jump consistent hash
Consistent hashing with bounded loads in Golang
Add a description, image, and links to the consistent-hashing-library topic page so that developers can more easily learn about it.
To associate your repository with the consistent-hashing-library topic, visit your repo's landing page and select "manage topics."