← All parts of this equation

Equation 3 · Part 6 · How AI Datacenter Systems Engineering Actually Works

superscript

Padmit(n)≈p n.P_{\text{admit}}(n) \approx p^{\,n}.
superscript

What this part means

A raised number can be a power. When it is a label or bound, it selects a case or the upper limit of a sum; the formula’s structure distinguishes these uses.

Its job in the formula

A raised mark can be a power or an index. Its position and the surrounding notation determine which.

The passage around this formula

A minimal model makes the difficulty explicit. If each of a fleet’s ranks is independently healthy and idle with probability p at a random instant, the probability that all n ranks a job needs are simultaneously available is Padmit(n)≈p nP_{\text{admit}}(n) \approx p^{\,n}. This is a simplification — real fleets are not independent, and real schedulers do not wait for a spontaneous coincidence — but it explains why gang admission gets combinatorially harder, not linearly harder, as jobs grow, and why every production scheduler in this space is built around avoiding literal simultaneous-availability matching rather than performing it. Google’s Borg, one of the earliest cluster managers to operate at this scale, achieves…

Read this part in the article →

Learn the underlying idea

An exponent tells how a base is used in multiplication. In x³, x is the base and 3 is the exponent: x³ = x × x × x.

Open the illustrated exponents: repeated multiplication and powers guide →

Sources cited in the surrounding passage

These citations provide research context; check each source for the exact claim it supports.