Cache Stampede Prevention: Distributed Locking, Pub/Sub, and Request Coalescing
From distributed locks to request coalescing: techniques for coordinating cache rebuilds and preventing cascading failures.
Engineering At Scale
Weekly column simplifying databases, system design, architecture, and engineering careers with easy explanations, valuable insights, and expert advice.
Live Last read · last published · next check
Latest posts
Redis Locks: Working, Failure Modes and Real-World Examples
How do reservation systems prevent thousands of concurrent users from booking the same seat?
How Distributed Systems Store Files: Databases, Object Storage, and the Trade-offs
From database BLOBs to object stores — understanding the architecture patterns and when to use each
Database Proxies: Connection Management at Scale
How to scale a database to handle 100K connections?
Connection Pooling: Fundamentals, Challenges and Trade-offs
How to handle 10,000 concurrent requests without crashing your database
API Pagination: Techniques, Real-World Applications And Best Practices
Learn how X (Twitter) and Spotify use API pagination to handle massive datasets efficiently
Anatomy of Facebook's 2010 outage: Cache invalidation gone wrong
How a cache validation bug cascaded into Facebook's longest downtime
Library vs Service: Lessons from Netflix's Multi-Year Migration
In-depth framework to choose between a library and a service
How NGINX's Event-Driven Architecture Handles Million Concurrent Connections ?
Overview of NGNIX's Event Driven Non-Blocking I/O Architecture
Redis Persistence Dive Deep - Trade-offs Between Performance And Durability
Understanding AOF and RDB strategies, their trade-offs and applications