An overview of rendezvous hashing, a simple way to assign objects to servers without a central coordinator. Each server gets a score from the object and server names, and the highest score wins. Every client reaches the same result, and adding or removing a server moves only the objects affected by that change. The article also compares the method with consistent hashing and covers replication, weights, and faster variants.
A clear guide to the Generic Cell Rate Algorithm (GCRA), which is used for leaky bucket rate limiting. Instead of tracking a counter and refilling it on a timer, GCRA stores one timestamp and uses a simple calculation to decide whether to allow a request. The post explains the idea step by step and shows why it needs little memory and is easy to build.