← Mathematical compendium

Published equation contexts

Srequest≤max⁡i(freei)S_{\mathrm{request}} \le \max_i(\mathrm{free}_i)

Why this formula appears here

A device can report gigabytes of free memory and still kill the process that asks for a much smaller allocation, because the operating system’s out-of-memory killer does not care about total free memory — it cares about whether a single contiguous block large enough for the request exists. Large weight tensors and growing key-value caches on a constrained device fragment memory into scattered free regions faster than they fill it, and an allocation can fail against a device that is, in aggregate, nowhere near full. is the condition that actually governs whether an allocation succeeds, and it can fail even when SrequestS_{\mathrm{request}} ≤\le ∑i\sum_i freei\mathrm{free}_i holds comfortably — the requested…

Read the full article-specific guide →

Read the representative guide

SrequestS_{\mathrm{request}}

Symbol S_request

SrS_request 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 →
ii

Symbol i

i 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

Read this expression with the definitions, units, and assumptions supplied by the article.

Research cited beside this formula

Learn the mathematics behind it

Published contexts (1)

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

Srequest≤max⁡i(freei)S_{\mathrm{request}} \le \max_i(\mathrm{free}_i)

Equation 1 · Edge AI & Electronics

Ten Failure Modes That Define Small and On-Device AI Deployments

This equation states a bound: one expression must stay on the indicated side of the other under the article’s assumptions.

A device can report gigabytes of free memory and still kill the process that asks for a much smaller allocation, because the operating system’s out-of-memory killer does not care about total free memory — it cares about whether a single contiguous block large enough for the request exists. Large weight tensors and growing key-value caches on a constrained device fragment memory into scattered free regions faster than they fill it, and an allocation can fail against a device that is, in aggregate, nowhere near full. is the condition that actually governs whether an allocation succeeds, and it can fail even when SrequestS_{\mathrm{request}} ≤\le ∑i\sum_i freei\mathrm{free}_i holds comfortably — the requested…

Equation guide → · Article →