The design and implementation of a parallel array operator for the arbitrary remapping of data

  • Authors:

  • Steven J. Deitz;Bradford L. Chamberlain;Sung-Eun Choi;Lawrence Snyder

  • Affiliations:

  • University of Washington, Seattle, WA;Cray Inc., Seattle, WA and University of Washington, Seattle, WA;Los Alamos National Laboratory, Los Alamos, NM;University of Washington, Seattle, WA

  • Venue:
  • Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Gather and scatter are data redistribution functions of long-standing importance to high performance computing. In this paper, we present a highly-general array operator with powerful gather and scatter capabilities unmatched by other array languages. We discuss an efficient parallel implementation, introducing three new optimizations---schedule compression, dead array reuse, and direct communication---that reduce the costs associated with the operator's wide applicability. In our implementation of this operator in ZPL, we demonstrate performance comparable to the hand-coded Fortran + MPI versions of the NAS FT and CG benchmarks.