multiplication

The passage around this formula

Matrix multiplication is the canonical demonstration because it has enormous latent reuse and a naive schedule that throws almost all of it away. Multiplying two N $\times$ N matrices performs about 2$N^3$ operations on 3$N^2$ words — an intensity proportional to N , which for large N is spectacularly compute-bound in principle. Executed as three nested loops in the obvious order, though, each element of one input is re-read from main memory on every pass, and the realised intensity collapses toward a small constant. The available reuse and the exploited reuse are different quantities, and only the second appears in the roofline.

Read this part in the article →