Research reports

Communication Efficiency of Parallel 3D FFTs

by A. Adelmann and A. Bonelli and W. P. Petersen and C. W. Überhuber

(Report number 2004-04)

Abstract
This paper describes the empirical investigation of the communication to computation time ratio of three-dimensional parallel FFTs. Different problem sizes, number of processes, and various communication networks are considered. Results are given on algorithms developed at the Vienna University of Technology, the Paul Scherrer Institut, and ETH Zurich. All transposition algorithms of this study were portably implemented in MPI. Thus, the communication performance on specific networks reflects the efficiency of these MPI implementations.

Keywords:

BibTeX
@Techreport{ABPÜ04_331,
  author = {A. Adelmann and A. Bonelli and W. P. Petersen and C. W. Überhuber},
  title = {Communication Efficiency of Parallel 3D FFTs},
  institution = {Seminar for Applied Mathematics, ETH Z{\"u}rich},
  number = {2004-04},
  address = {Switzerland},
  url = {https://www.sam.math.ethz.ch/sam_reports/reports_final/reports2004/2004-04.pdf },
  year = {2004}
}

Disclaimer
© Copyright for documents on this server remains with the authors. Copies of these documents made by electronic or mechanical means including information storage and retrieval systems, may only be employed for personal use. The administrators respectfully request that authors inform them when any paper is published to avoid copyright infringement. Note that unauthorised copying of copyright material is illegal and may lead to prosecution. Neither the administrators nor the Seminar for Applied Mathematics (SAM) accept any liability in this respect. The most recent version of a SAM report may differ in formatting and style from published journal version. Do reference the published version if possible (see SAM Publications).

JavaScript has been disabled in your browser