Equation 2 · Locality Is the Whole Game: The Memory Hierarchy and What a Kernel Does Not Read
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 a bound: one expression must stay on the indicated side of the other 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 P
P is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.
subscript
The lower label selects a particular version, component, or indexed member of the quantity. For example, x₀ and xₜ can be values at different positions.
How to interpret it
Read this expression with the definitions, units, and assumptions supplied by the article.
What the article says around this equation
The quantity that decides which of these limits binds is arithmetic intensity : the number of arithmetic operations a kernel performs per byte it moves across a given level. Williams, Waterman and Patterson formalised the consequence as the roofline model, which relates attainable floating-point performance to operational intensity and memory bandwidth in a single visual bound [ 5 ] . Written as an inequality, attainable performance P satisfies . with the peak arithmetic rate, I the arithmetic intensity in operations per byte, and B the achievable bandwidth at the level that dominates. The two terms cross at a ridge point = /B . Below it a kernel is…
Read the full surrounding passage
The quantity that decides which of these limits binds is arithmetic intensity : the number of arithmetic operations a kernel performs per byte it moves across a given level. Williams, Waterman and Patterson formalised the consequence as the roofline model, which relates attainable floating-point performance to operational intensity and memory bandwidth in a single visual bound [ 5 ] . Written as an inequality, attainable performance P satisfies . with the peak arithmetic rate, I the arithmetic intensity in operations per byte, and B the achievable bandwidth at the level that dominates. The two terms cross at a ridge point = /B . Below it a kernel is memory-bound and its runtime is set by traffic; above it the kernel is compute-bound and traffic is hidden.
Sources cited in the surrounding passage
These citations give research context. Read each source to check which claims it supports.
Return to Locality Is the Whole Game: The Memory Hierarchy and What a Kernel Does Not Read