Latest8 min readSaurav K.
Atomic Doesn't Mean Exactly Once: What Distributed Rate Limiters Actually Guarantee
Where atomic Redis admission ends, how timeouts and leases fail, and what applications need for recoverable external work.
Engineering articles on rate limiting, distributed systems, and Valve’s design.
6 articles, newest first
Latest8 min readSaurav K.
Where atomic Redis admission ends, how timeouts and leases fail, and what applications need for recoverable external work.
How sequential reservations spend quota before a request can run, and when one atomic admission is the right boundary.
7 min readSaurav K.
Compare scheduler composition with atomic provider-budget admission, including pacing, groups, concurrency, retries, and Redis ownership.
7 min readSaurav K.
Model shared, tenant, and recipient quotas with scoped rules, explicit bursts, and a daily counter.
7 min readSaurav K.
How strict GCRA pacing turns scheduling delays into unused capacity, with a local probe for measuring grants and callback starts.
7 min readSaurav K.
Why workers retry against one shared Redis budget, how Valve schedules those attempts, and how to measure contention.
8 min readSaurav K.