The article outlines five Redis deployment patterns—from a single‑instance setup to official Redis Cluster—detailing their architectures, advantages, drawbacks, and suitable scenarios, helping engineers choose the right solution for scalability, high availability, and operational complexity.
This article examines the open‑source XXL-JOB distributed task scheduler, explaining its lightweight architecture, time‑wheel based scheduling, consistent‑hash routing, sharding mechanisms, and includes annotated source code snippets to illustrate key implementation details for backend developers.
This article compares common database sharding strategies—range sharding, mapping tables, ID modulo, hash‑based sharding, and consistent hashing—explaining their implementation complexity, data distribution characteristics, scalability concerns, and practical trade‑offs with code examples.
This tutorial demonstrates how to install Aeraki Mesh, view its default Round Robin load balancing, and configure a Consistent Hash algorithm for Dubbo services using Istio DestinationRule metadata, then verifies the behavior and explains the underlying RDS routing configuration.
This article explains the principles of consistent hashing, its data‑skew issue, how virtual nodes mitigate that problem, and demonstrates the implementation and usage of ConsistentHashLoadBalance in Dubbo with detailed code analysis and practical load‑balancing examples.
This article revisits Jump Consistent Hash, analyzes the O(n) bottleneck of the original algorithm, derives a probability‑based selection method that achieves O(log n) complexity, and provides a Go implementation demonstrating the optimized approach.
Facing frequent service outages as their microservice count grew, MasterTeach migrated from Eureka to Alibaba Nacos, designing a high‑availability Nacos‑Eureka sync solution with consistent‑hash sharding, Zookeeper/Etcd coordination, automated DevOps integration, and extensive fault‑tolerance testing to ensure stable operation of over 660 services.
This article explains the principle of jump consistent hashing, compares it with traditional ring‑based methods, shows a step‑by‑step implementation with Go code, and discusses its performance advantages and potential optimizations for distributed key‑value storage systems.
The article introduces a Java HashNodeService interface and demonstrates two data distribution algorithms—simple modulo hashing, which evenly spreads keys but remaps them heavily when nodes change, and consistent hashing with optional virtual nodes, which maintains balanced placement and high cache‑hit rates despite topology adjustments.
This article explains the principles, characteristics, and performance trade‑offs of the consistent‑hash (ring‑hash) and jumpstringhash sharding algorithms used by DBLE, presents test results on variance, latency and data balance, and concludes why DBLE prefers jumpstringhash.
