Equation 1 · From Origins to Frontier: A History of AI Memory Systems and the Bandwidth Wall
What does this equation mean?
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.
This equation states an equality: the expressions on both sides have the same value under the article’s assumptions. 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
Symbol t
t is an argument of the function-like quantity on the left; its role is set by that function’s stated inputs.
=
The expressions on both sides represent the same quantity under the stated assumptions.
See an illustrated explanation →superscript
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.
See an illustrated explanation →Denominator: bandwidth(t)
The complete quantity below the fraction bar; it must be nonzero for this division.
Denominator: bandwidth(0)
The complete quantity below the fraction bar; it must be nonzero for this division.
Denominator: 1.6
The complete quantity below the fraction bar; it must be nonzero for this division.
How to interpret it
With a fixed numerator, increasing a nonzero denominator reduces the fraction. Read it with the definitions, units, and assumptions supplied by the article.
What the article says around this equation
The scale of that abstract argument, made concrete decades later, is stark. Gholami and colleagues, surveying twenty years of server hardware, report that peak hardware FLOPS scaled at roughly 3.0 times every two years while DRAM bandwidth scaled at only 1.6 times and interconnect bandwidth at 1.4 times over the same interval [ 13 ] . Those are compounding rates, and compounding rates diverge violently over long periods. If the two multipliers applied uniformly across a full twenty years — an extrapolation the source itself does not perform, offered here only to size the shape of the problem, not as a number the cited paper states — the ratio between available arithmetic and available…
Read the full surrounding passage
The scale of that abstract argument, made concrete decades later, is stark. Gholami and colleagues, surveying twenty years of server hardware, report that peak hardware FLOPS scaled at roughly 3.0 times every two years while DRAM bandwidth scaled at only 1.6 times and interconnect bandwidth at 1.4 times over the same interval [ 13 ] . Those are compounding rates, and compounding rates diverge violently over long periods. If the two multipliers applied uniformly across a full twenty years — an extrapolation the source itself does not perform, offered here only to size the shape of the problem, not as a number the cited paper states — the ratio between available arithmetic and available bandwidth grows as . with t measured in years. At t = 20 that factor works out to (3.0/1.6)^{10} 540 : a roughly five-hundredfold widening of the gap in raw compounding terms, and that is before accounting for the interconnect term separately. No single memory technology closes a gap shaped like that on its own. Every technology discussed below narrows it at one particular tier, for one particular class of workload, for a while — which is exactly why the industry kept needing a new one.
Sources cited in the surrounding passage
These citations give research context. Read each source to check which claims it supports.
Return to From Origins to Frontier: A History of AI Memory Systems and the Bandwidth Wall