← Mathematical compendium

Published equation contexts

Q(b)  ≈  2N3b+N2,subject to3b2≤MQ(b) \;\approx\; \frac{2N^3}{b} + N^2, \qquad \text{subject to} \quad 3b^2 \le M

Why this formula appears here

The repair is to restructure the loops so that the working set of the innermost computation is small enough to sit in a fast store and is used many times before being evicted. Partition the operands into b ×\times b blocks and compute block by block. Three such blocks — two inputs and an accumulator — must be resident simultaneously, so the tile size is bounded by the fast-store capacity M in words: Q(b)  ≈  2N3b+N2,subject to3b2≤MQ(b) \;\approx\; \frac{2N^3}{b} + N^2, \qquad \text{subject to} \quad 3b^2 \le M . Taking b as large as the constraint allows gives

Read the full article-specific guide →

Read the representative guide

QQ

Symbol Q

Q 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 →
MM

Symbol M

M 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.

Q(b)  ≈  2N3b+N2,subject to3b2≤M.Q(b) \;\approx\; \frac{2N^3}{b} + N^2, \qquad \text{subject to} \quad 3b^2 \le M .

Equation 17 · AI Hardware & Semiconductors

Locality Is the Whole Game: The Memory Hierarchy and What a Kernel Does Not Read

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

The repair is to restructure the loops so that the working set of the innermost computation is small enough to sit in a fast store and is used many times before being evicted. Partition the operands into b ×\times b blocks and compute block by block. Three such blocks — two inputs and an accumulator — must be resident simultaneously, so the tile size is bounded by the fast-store capacity M in words: Q(b)  ≈  2N3b+N2,subject to3b2≤MQ(b) \;\approx\; \frac{2N^3}{b} + N^2, \qquad \text{subject to} \quad 3b^2 \le M . Taking b as large as the constraint allows gives

Meanings in this article

  • bb: the traffic falls linearly in.
  • b2b^2: the square of b; the traffic falls linearly in.
Equation guide → · Article →