A lightweight library that implements consistent hashing
-
Updated
Jun 19, 2017 - Java
A lightweight library that implements consistent hashing
A distributed hash table (DHT) is a decentralised system for storing and retrieving data in a network. This is a sample implementation in Python
consitent hash algorithm
UUID Generator that uses Orbis.
A scalable, distributed key-value store with consistent hashing for low latency performance.
A DHT using Consistent Hashing where each node maintains a reference to the next and previous nodes on the hash ring.
Dynamically scales and balances workloads in a Kubernetes environment based on table values, utilizing a consistent hashing algorithm to ensure stable distribution across worker nodes. It effortlessly adapts to changes in table data or worker count, ensuring optimal resource allocation and efficiency.
An object extension for generating a consistent Hash of any object for every program run
🌐 Labs, assignments and exams for class Enterprise Distributed System at SJSU
Implementation of consistent hashing
Social Media Service like Facebook prototype with Distributed Servers, Consistent Hashing, Load Balancing, Scalability and Fault Tolerance aspects.
A dump load balancer routing traffic based on bounded consistent hashing strategy
📲cim(cross IM) 适用于开发者的分布式即时通讯系统
Add a description, image, and links to the consistent-hashing topic page so that developers can more easily learn about it.
To associate your repository with the consistent-hashing topic, visit your repo's landing page and select "manage topics."