Aggregated Highest Random Weight Hashing / Aggregated Rendezvous Hashing
-
Updated
May 13, 2024 - Go
Aggregated Highest Random Weight Hashing / Aggregated Rendezvous Hashing
General-purpose header-only consistent hash ring implementation
consistent hashing data structure
consitent hash algorithm
一致性哈希
A demonstration of consistent hashing.
minimal Consistent Hash Ring implementation in go
High performance Ring Consistent Hash implementation
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.
High availability distributed system for a cloud-based shopping list application, using CRDTs and consistent hashing.
class presentation on scalable web architectures/distributed web crawling | comp 599 graduate seminar | fall 2018 | spring 2019
Implementation of jump consistent hashing from From the paper "A Fast, Minimal Memory, Consistent Hash Algorithm" by John Lamping, Eric Veach (2014).
JumpBackHash: Say Goodbye to the Modulo Operation to Distribute Keys Uniformly to Buckets
Example to Simulate Distributed Consistent Hashing
A simple and fast consistent hash-ring for go
Golang 's implementation of consistent hashing algorithm using hash ring, which is thread-safe, and can be used concurrently.
Rust implementation for consisent hashing
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."