A new transpose split method for three-dimensional FFTs: performance on an Origin2000 and Alphaserver cluster

Authors:
P. Wapperom;A. N. Beris;M. A. Straka
Affiliations:
Department of Chemical Engineering, University of Delaware, Newark, DE 19716-3110, USA;Department of Chemical Engineering, University of Delaware, Newark, DE 19716-3110, USA;National Center for Supercomputing Applications, 4131 Beckman Institute, 405 N. Mathews Avenue, Urbana, IL 61801, USA
Venue:
Parallel Computing
Year:
2006

Citing 2
Cited 3

Symmetric FFTs

Mathematics of Computation
Implementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communication

Parallel Computing

Development and evaluation of high-performance decorrelation algorithms for the nonalternating 3D wavelet transform

EURASIP Journal on Applied Signal Processing
An efficient in-place 3D transpose for multicore processors with software managed memory hierarchy

IFMT '08 Proceedings of the 1st international forum on Next-generation multicore/manycore technologies
Parallel Algorithms Based on the Temporal-Window Method for Non-Alternating 3D-WT over Angiographies Using a Multicomputer

Journal of Signal Processing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss a new transpose split method for parallel computations of three-dimensional Fourier transforms. By splitting the data along two dimensions over the processors it allows for a higher degree of parallelization than the original transpose split method. The traditional transpose split method involves one alltoall communication. The new method involves two communication steps in which each processor performs an ''alltoall'' communication in groups. The performance of the new method has been evaluated using MPI on an Origin2000 and an Alphaserver cluster and compared with the traditional transpose split method. We found that the extra communication step introduced in the new method only slightly increases communication time. However, an efficient parallelization depends critically on how fast the communications can be performed.