← Back to article

Equation 3 · How AI Memory Systems and the Bandwidth Wall Actually Work

What does this equation mean?

BB

Read the formula alongside the article passage below. Each part has a deeper page with its role in the equation, the supporting passage and nearby citations.

the achievable bandwidth of the memory tier supplying the operands. Read the equation part by part below; each part has a contextual explanation and a link to its mathematical background.

Read it piece by piece

BB

Symbol B

the achievable bandwidth of the memory tier supplying the operands.

Understand this part →

How to interpret it

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

What the article says around this equation

with Pmax⁡P_{\max} the peak arithmetic rate of the device, B the achievable bandwidth of the memory tier supplying the operands, and P the attainable performance [ 11 ] . The two terms cross at a ridge point I∗I^{*} = Pmax⁡P_{\max}/B : below it, runtime is set by how many bytes must move, whatever the peak arithmetic rate promises; above it, the arithmetic units are the limit and the memory system is idle capacity. Because peak compute has grown roughly twice as fast as memory bandwidth for two decades running [ 12 ] , that ridge point has been climbing — a kernel that was comfortably compute-bound on one generation of hardware can become memory-bound on the next without a single line of its code…
Read the full surrounding passage
with Pmax⁡P_{\max} the peak arithmetic rate of the device, B the achievable bandwidth of the memory tier supplying the operands, and P the attainable performance [ 11 ] . The two terms cross at a ridge point I∗I^{*} = Pmax⁡P_{\max}/B : below it, runtime is set by how many bytes must move, whatever the peak arithmetic rate promises; above it, the arithmetic units are the limit and the memory system is idle capacity. Because peak compute has grown roughly twice as fast as memory bandwidth for two decades running [ 12 ] , that ridge point has been climbing — a kernel that was comfortably compute-bound on one generation of hardware can become memory-bound on the next without a single line of its code changing.

Read the equation in its article →

Sources cited in the surrounding passage

These citations give research context. Read each source to check which claims it supports.

Return to How AI Memory Systems and the Bandwidth Wall Actually Work

Browse the mathematical compendium →