Mapping affine loop nests: New results

  • Michèle Dion
  • Yves Robert
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 919)


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.


Loop Nest Communication Graph Alignment Problem Nonlocal Term Target Architecture 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Jennifer M. Anderson and Monica S. Lam. Global optimizations for parallelism and locality on scalable parallel machines. ACM Sigplan Notices, 28(6):112–125, June 1993.CrossRefGoogle Scholar
  2. 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
  3. 3.
    Alain Darte and Yves Robert. Mapping uniform loop nests onto distributed memory architectures. Parallel Computing, 20:679–710, 1994.CrossRefGoogle Scholar
  4. 4.
    Alain Darte and Yves Robert. On the alignment problem. Parallel Processing Letters, 4(3):259–270, 1994.CrossRefMathSciNetGoogle Scholar
  5. 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 in the pub/Rapports/RR/RR 94 directory.Google Scholar
  6. 6.
    Paul Feautrier. Towards automatic distribution. Parallel Processing Letters, 4(3):233–244, 1994.CrossRefGoogle Scholar
  7. 7.
    Jingke Li and Marina Chen. The data alignment phase in compiling programs for distributed memory machines. Journal of Parallel and Distributed Computing, 13:213–221, 1991.CrossRefGoogle Scholar
  8. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Michèle Dion
    • 1
  • Yves Robert
    • 1
  1. 1.Laboratoire LIPCNRS (U.R.A. nℴ 1398) Ecole Normale Supérieure de LyonLyon Cedex 07France

Personalised recommendations