Computational Mathematics and Scientific Computing Seminar

Communication Lower Bounds for Loop Nests

Speaker: Nicholas Knight, CIMS

Location: Warren Weaver Hall 1302

Date: April 1, 2016, 10 a.m.


Communication (data movement) often dominates runtime and energy costs. We consider the problem of reorganizing loop nests to minimize communication. For loop nests that access array variables subscripted by linear functions of the loop iteration vector, the algebraic relationship between variables and operations leads to communication lower bounds applicable to any reordering of the loop iterations.