cache-stampede · research · also Cache miss storm, Dog-piling

Cache stampede

A cache stampede occurs when overlapping requests for one unavailable cached value independently start redundant work to reconstruct it.

Related Observatory article: Read on hesela.com

Triggers: Expiration, eviction or invalidation can expose a hot key to concurrent misses. A high aggregate hit ratio does not describe the concentration of backend work around that event. [1]

Coordination: A key-bound refill token can authorize cache publication and reject a stale fill after invalidation. Regulating token issuance also suppresses repeated backend fetches. Serving an older value is a separate application freshness decision. [2]

Relations

related
XFetch, Request coalescing (cache), Delayed cache hit, Segcache

Citations

  1. Vattani, Chierichetti and Lowenstein. Optimal Probabilistic Cache Stampede Prevention. PVLDB 8(8), 886-897 (2015), sections 2-5. (accessed 2026-11-20)
  2. Nishtala et al. Scaling Memcache at Facebook. NSDI 2013, pp. 385-398, section 3.2.1. (accessed 2026-11-20)
Sources & caveats
  • Primary-source review, not a reproduction of the systems' throughput or workload measurements.

JSON: /data/terms/cache-stampede.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Cache stampede. Hesela. 2026-11-20. https://hesela.dev/terms/cache-stampede/