Mapping Affine Loop Nests: New Results

摘要

This paper deals with the problem of aligning data and computations when mapping affine loop nests onto distributed memory parallel computers. We formulate the problem by introducing a new graph, the access graph, to model affine communications (with rectangular access matrices) more adequately than in previous literature.