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.
Unable to display preview. Download preview PDF.
- 2.Tzung-Shi Chen and Jang-Ping Sheu. Communication-free data allocation techniques for parallelizing compilers on multicomputers. IEEE Transactions on Parallel and Distributed Systems, 5(9):924–938, 1994.Google Scholar
- 5.Michèle Dion and Yves Robert. Mapping affine loop nests: New results. Research Report 94-30, Laboratoire de l'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon, November 1994. Available by anonymous ftp to lip.enslyon.fr in the pub/Rapports/RR/RR 94 directory.Google Scholar
- 8.W. Shang and Z. Shu. Data alignment of loop nests without nonlocal communications. In Application Specific Array Processors, pages 439–450. IEEE Computer Society Press, 1994.Google Scholar