Solving the constant-degree parallelism alignment problem

  • Claude G. Diderich
  • Marc Gengler
Workshop 03 Automatic Parallelization and High Performance Compilers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1123)


We describe an exact algorithm for finding a computation mapping and data distributions that minimize, for a given degree of parallelism, the number of remote data accesses in a distributed memory parallel computer (DMPC). This problem is shown to be NP-hard.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    E. Amaldi and V. Kann. The complexity and approximability of finding maximum feasible subsystems of linear relations. Theoret. Comput. Sci., 147(1–2):181–210, 1995.CrossRefGoogle Scholar
  2. 2.
    J. M. Anderson and M. S. Lam. Global optimizations for parallelism and locality on scalable parallel machines. In Proc. PLDI '93, pages 112–125, 1993.Google Scholar
  3. 3.
    D. Bau, I. Kodukula, V. Kotlyar, K. Pingali, and P. Stodghill. Solving alignment using elementary linear algebra. In Proc. LCPC '94, LNCS 892, pages 46–60, Springer, 1994.Google Scholar
  4. 4.
    C. G. Diderich and M. Gengler. Solving the constant-degree parallelism alignment problem. Research Rep. DI-96/195, Swiss Fed. Inst. of Tech.-Lausanne, Switzerland, 1996.Google Scholar
  5. 5.
    Michèle Dion and Yves Robert. Mapping affine loop nests: New results. In Proc. HPCN '95, LNCS 919, pages 184–189, Springer, 1995.Google Scholar
  6. 6.
    C.-H. Huang and P. Sadayappan. Communication-free hyperplane partitioning of nested loops. In Proc. LCPC '91, LNCS 589, pages 186–200, Springer, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Claude G. Diderich
    • 1
  • Marc Gengler
    • 2
  1. 1.Computer Science DepartmentSwiss Federal Institute of Technology - LausanneLausanneSwitzerland
  2. 2.Laboratoire de l'Informatique du ParallélismeEcole Normale Supérieure de LyonLyonFrance

Personalised recommendations