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.