← Mathematical compendium

Published equation contexts

f(T)≈τT+λT2f(T) \approx \frac{\tau}{T} + \frac{\lambda T}{2}

Why this formula appears here

Analysis. The following calculation is my own, built to make the MLPerf numbers’ shape explicit rather than to reproduce them exactly. Model checkpoint writes as occurring every T hours, each costing τ\tau hours of write time, with failures arriving as a Poisson process at fleet-wide rate λ\lambda (failures per hour). For λ\lambda T ≪\ll 1 , a failure inside an interval loses on average T/2 hours of recomputation, so the expected fraction of wall-clock time lost to the combination of checkpoint overhead and lost recompute is approximately f(T)≈τT+λT2f(T) \approx \frac{\tau}{T} + \frac{\lambda T}{2}. Minimizing over T gives an optimal interval T∗T^{*} = 2τ/λ\sqrt{2\tau/\lambda} : the checkpoint interval should shrink as the inverse square…

Read the full article-specific guide →

Read the representative guide

ff

Symbol f

f is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.

Read this term in its guide →
TT

Symbol T

T is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.

Read this term in its guide →

How to interpret it

With a fixed numerator, increasing a nonzero denominator reduces the fraction. Its accuracy depends on the assumptions and range of use described in the article.

Research cited beside this formula

Published contexts (1)

A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.

f(T)≈τT+λT2.f(T) \approx \frac{\tau}{T} + \frac{\lambda T}{2}.

Equation 12 · Datacenters

AI Datacenter Systems Engineering in 2035: Scenarios, Signals, and Falsifiable Predictions

This equation gives an approximation: it relates the quantities while allowing an approximation.

Analysis. The following calculation is my own, built to make the MLPerf numbers’ shape explicit rather than to reproduce them exactly. Model checkpoint writes as occurring every T hours, each costing τ\tau hours of write time, with failures arriving as a Poisson process at fleet-wide rate λ\lambda (failures per hour). For λ\lambda T ≪\ll 1 , a failure inside an interval loses on average T/2 hours of recomputation, so the expected fraction of wall-clock time lost to the combination of checkpoint overhead and lost recompute is approximately f(T)≈τT+λT2f(T) \approx \frac{\tau}{T} + \frac{\lambda T}{2}. Minimizing over T gives an optimal interval T∗T^{*} = 2τ/λ\sqrt{2\tau/\lambda} : the checkpoint interval should shrink as the inverse square…

Equation guide → · Article →