Abstract

Many high performance applications spend considerable time packing noncontiguous data into contiguous communication buffers. MPI Datatypes provide an alternative by describing noncontiguous data layouts. This allows sophisticated hardware to retrieve data directly from application data structures. However, packing codes in real-world applications are often complex and specifying equivalent datatypes is difficult, time-consuming, and error prone. We present an algorithm that automates the transformation. We have implemented the algorithm in a tool that transforms packing code to MPI Datatypes, and evaluated it by transforming 90 packing codes from the NAS Parallel Benchmarks. The transformation allows easy porting of applications to new machines that benefit from datatypes, thus improving programmer productivity.

Article

pdf

BibTeX

@article{kjolstad2012datatypegeneration,
  title={Automatic Datatype Generation and Optimization},
  author={Fredrik Kjolstad and Torsten Hoefler and Marc Snir},
  journal={17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},
  year={2012},
  month={February}
}