Efficient mapping of interdependent scans
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.
- 1.Barreteau, Feautrier: Automatic Mapping of Scans and Reductions. HPCS'95. 1995.Google Scholar
- 3.Feautrier: Toward Automatic Partitioning of Arrays on Distributed Memory Computers. In ACM ICS'93 Tokyo pp.175–184. 1993.Google Scholar
- 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