Skip to main content
abstractalgorithms.devAbstract Algorithms
← All Problemssystem-designmedium~30 min

Redis Maxmemory Eviction Thrashing on Volatile-LRU Under Write Surges

Redis instance configured with maxmemory 16 GB and volatile-lru eviction policy.

Scope, Requirements & Constraints

Redis instance configured with maxmemory 16 GB and volatile-lru eviction policy. Failure cascade dynamic: 100k QPS → TTL Expiration → Cache Miss Herd → Origin Slam → 💥 DB Meltdown.

Core Functional Requirements

  • ✓Operational Invariant: "Unless dedicated strictly as a durable data store, configure caching Redis instances with allkeys-lru/lfu eviction."
  • ✓Production Hardening: Configure eviction policy to allkeys-lru (or allkeys-lfu), ensuring that least recently used keys are eligible for eviction regardless of TTL flags, and set strict memory usage ale
  • ✓Prevent cascading failure by isolating downstream degradation at the ingress boundary.

Scale & Latency Constraints

  • —Incident Scenario Baseline: Redis instance configured with maxmemory 16 GB and volatile-lru eviction policy.
  • —Failure Cascade Path: 100k QPS → TTL Expiration → Cache Miss Herd → Origin Slam → 💥 DB Meltdown
  • —Sub-millisecond rejection / shed latency for overloaded requests

Reference Architecture & System Blueprint

Configure eviction policy to allkeys-lru (or allkeys-lfu), ensuring that least recently used keys are eligible for eviction regardless of TTL flags, and set strict memory usage alert thresholds at 75%. Invariant: "Unless dedicated strictly as a durable data store, configure caching Redis instances with allkeys-lru/lfu eviction."

System Architecture Blueprint
Production Topology
Redis Maxmemory Eviction Thrashing on Volatile-LRU Under Write Surges Architecture Blueprint
Architecture Flow NarrativeIngress → Bounded Admission Controller → Adaptive Concurrency / Queue Gate → Protected Worker Engine; Overload Shed Path → HTTP 429 / Circuit Fallback (<0.1ms).

Hardened Implementation Steps

  1. 1Ingress Boundary Defense: Configure eviction policy to allkeys-lru (or allkeys-lfu), ensuring that least recently used keys are eligible for eviction regardless of TTL flags, a
  2. 2Failure Containment: Eliminate unconstrained buffering and propagate physical backpressure.
  3. 3Invariant Enforcement: Unless dedicated strictly as a durable data store, configure caching Redis instances with allkeys-lru/lfu eviction.

Production Code Contrast & Implementation

java
// HARDENED: Singleflight mutex coalescing with probabilistic early refresh
public byte[] getProduct(String key) {
    // XFetch algorithm evaluates early background refresh before TTL expiration
    if (shouldProbabilisticEarlyRefresh(key, beta, delta)) {
        backgroundPool.submit(() -> refreshCacheKey(key));
    }
    // Singleflight ensures exactly ONE upstream DB fetch executes per in-flight key
    return singleflightGroup.execute(key, () -> database.queryProduct(key));
}

Key Decisions & Trade-Off Analysis

Architectural comparison of naive unconstrained allocations versus production-hardened mechanical sympathy.

Architectural Decisions & Trade-Offs

  • ⚖Ingress Admission: Naive unconstrained buffering causes queue bloat and GC exhaustion. Mitigation: Bounded ingress gate with fast non-blocking shedding.
  • ⚖Resource Strategy: Static capacity allocations collapse under brownouts. Mitigation: Dynamic adaptive limits scaling to real-time physical bounds.
  • ⚖Outage Impact: Cascading lock convoys and memory saturation. Mitigation: Isolated failure domains keep P99 latency flat and protected.

Alternatives Evaluated

  • →Naive Approach: A developer writes 5 GB of ephemeral session data without setting a TTL (no expiry). Since keys have no TTL, volatile-lru cannot evict them. When memo
  • →Production-Hardened Pattern: Configure eviction policy to allkeys-lru (or allkeys-lfu), ensuring that least recently used keys are eligible for eviction regardless of TTL flags, a

Scale Bottlenecks & Operational Hazards

Operational Hazards & Mitigations

  • ⚠Cascading Failure: A developer writes 5 GB of ephemeral session data without setting a TTL (no expiry). Since keys have no TTL, volatile-lru cannot evict them. When memory fills, Redis throws 'OOM command not allowed when used memory > maxmemory', crashing write flows.
  • ⚠Breakdown Chain: 100k QPS → TTL Expiration → Cache Miss Herd → Origin Slam → 💥 DB Meltdown
  • ⚠Shedding Failure: Without fast rejection at the boundary, queued dead work triggers multi-second GC pauses, CPU thrashing, and cascading 504 Gateway Timeouts.

Changed Constraints & System Extension

How does the system enforce physical resource boundaries under sudden downstream latency brownouts?

Extension Implementation Steps

  1. 1Track real-time latency gradients and inflight concurrency.
  2. 2Reject excess traffic at the ingress boundary within <0.1ms.
  3. 3Monitor P99 latency and verify autonomous recovery when downstream pressure subsides.

Follow-Up Trade-Offs

  • ⚖Architectural Invariant: "Unless dedicated strictly as a durable data store, configure caching Redis instances with allkeys-lru/lfu eviction."
  • ⚖Physical Resource Boundary: Dynamic admission control ensures worker threads never buffer dead requests during downstream brownouts.

Interactive Assessment & Knowledge Check

Test your understanding of the architecture decisions, data patterns, and trade-offs used in Redis Maxmemory Eviction Thrashing on Volatile-LRU Under Write Surges.

Interactive Practice Quiz•Question 1 of 3
intermediate

Single-Thread Execution Bottleneck

Why does Redis execute single-threaded command processing faster than traditional multi-threaded locked data structures?