WIT Press


Parallelization Of Fast Fourier Transforms

Price

Free (open access)

Paper DOI

10.2495/HPC000061

Volume

23

Pages

10

Published

2000

Size

976 kb

Author(s)

P. Bennett

Abstract

Parallelization of fast fourier transforms P. Bennett Albuquerque High Performance Computing Centre, University of New Mexico, USA Abstract The increasing success of High Performance Scalable Computing has brought with it enhanced capabilities in numerical modeling using spectral methods and large image processing. These types of algorithms require portable and reliable fast fourier transforms, or ffts. Unfortunately, many of the parallel ffts now available suffer from not being portable and not being as flexible as desired. In order to fill this need, Numerical Algorithms Group, Ltd., has ported their serial/vector ffts C06FUF and C06FXF to distributed memory architectures, with the communication enabled by the Basic Linear Algebra Communication Subroutines, or BLACS. The parallel ffts C06FUFP arid C06FXFP are portable and reliable, in addition to scaling well and being as flexible as their serial counterparts. This paper will present a discussion of the parallelization algorithm used t

Keywords