Efficient mapping of interdependent scans

  • Michel Barreteau
  • Paul Feautrier
Workshop 03 Automatic Parallelization and High Performance Compilers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1123)


Distributed memory multiprocessors are extremely sensitive to communication costs. Some global communications such as scans and reductions are of special interest since their cost is much lower than for point to point communications. Our paper focuses on an algorithm which efficiently takes the mapping of scans into account.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barreteau, Feautrier: Automatic Mapping of Scans and Reductions. HPCS'95. 1995.Google Scholar
  2. 2.
    Feautrier: Dataflow Analysis of Scalar and Array References. Int. J. of Parallel Programming, 20(1):23–53. 1991.CrossRefGoogle Scholar
  3. 3.
    Feautrier: Toward Automatic Partitioning of Arrays on Distributed Memory Computers. In ACM ICS'93 Tokyo pp.175–184. 1993.Google Scholar
  4. 4.
    Redon, Feautrier: Detection of Reductions in Sequentials Programs with Loops. PARLE, LNCS 694. Ed. Arndt Bode and Mike Reeve and Gottfried Wolf. 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Michel Barreteau
    • 1
  • Paul Feautrier
    • 1
  1. 1.Laboratoire PRiSMUniversité de Versailles - StQuentinVersaillesFrance

Personalised recommendations