Communication lower bounds for loop nests

Computer Science Presentation

Dr. Nicholas Knight, CIMS
New York University

Communication lower bounds for loop nests

Abstract: 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.

Thursday, June 1, 2017

10:00 AM

Manchester Hall, Room 229