xfetch · research · also Exponential early expiration, Probabilistic early expiration (XFetch)

XFetch

XFetch is a cache-refresh algorithm that uses an exponentially distributed time gap to trigger recomputation before a cached value expires.

Related Observatory article: Read on hesela.com

Mechanism: A request refreshes when a random look-ahead exceeds the remaining lifetime. The gap scale uses the previous recomputation duration and a positive tuning factor. Larger scales favor earlier refresh. [1]

Scope: The paper's bounds concern an arrival model and expected behavior, not a one-refresher guarantee for every request burst. [1]

Relations

related
Cache stampede, Request coalescing (cache), Cache admission

Citations

  1. Vattani, Chierichetti and Lowenstein. Optimal Probabilistic Cache Stampede Prevention. PVLDB 8(8), 886-897 (2015), sections 2-5. (accessed 2026-11-20)
Sources & caveats
  • Section 5 and Figure 3 supply the implementation rule; sections 2-4 define the renewal-arrival model and asymptotic bounds. No claim of workload replication.

JSON: /data/terms/xfetch.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. XFetch. Hesela. 2026-11-20. https://hesela.dev/terms/xfetch/