A distributed memory algorithm for 3-D FFTs

DOI10.1016/0377-0427(95)00163-8MaRDI QIDQ1919366zbMATH OpenOpenAlexFDO

Authors Calin R. Costian, Dan C. Marinescu

Publication date 11 February 1997

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-0427(95)00163-8

zbMATH Keywords

complexity analysisdistributed memory architecturesdivide-and-conquer methodfast Fourier transformparallel in-place algorithms

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Review text

This paper proposes an algorithm for the parallel in-place 3-D fast Fourier transform (FFT) on distributed memory architectures. In this algorithm, calculation is done by partitioning the 3-D input tensor into subtensors (one subtensor per nodes). The local FFTs are computed by the divide-and-conquer method, and the results are combined along the data partitioning strategy for minimum communication between nodes. The complexity of this algorithm is discussed in detail.

Recommendations

• FFT algorithms and their adaptation to parallel processing
• scientific article; zbMATH DE number 991433
• Two and three dimensional FFTs on highly parallel computers

Cites work

• Communication efficient multi-processor FFT
• Cooley-Tukey FFT on the Connection Machine
• Multiprocessor FFTs

Cited in

(5)

• Rotating a three-dimensional array in an optimal position for vector processing: Case study for a three-dimensional fast Fourier transform
• Efficient calculations of 3-D FFTs on spiral contours
• Parallel algorithm for SWFFT using 3D data structure
• scientific article; zbMATH DE number 1945235 (Why is no real title available?)
• Parallel Processing and Applied Mathematics

This page was built for publication: A distributed memory algorithm for 3-D FFTs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1919366)