Skip to main content

Section 2.6 Enrichments

Unit 2.6.1 Lower bounds on data movement

The dicussion regarding optimality in Section 2.5 is based on the paper

paper here

which itself builds upon many decades of work regarding lower bounds on memory operations required for a matrix-matrix multiplication. That paper also links the material in this week to that in the next week.