Fast fourier transform on hypercube parallel computers
Thesis/Dissertation
·
OSTI ID:6308055
The Fast Fourier Transform appears frequently in scientific computing. Therefore, it is desirable to implement it efficiently on parallel computeres. In this thesis, we investigate several different aspects of parallel Fast Fourier Transform implementation techniques for distributed-memory message-passing systems such as hypercube multiprocessors. Various Fast Fourier Transform algorithms are described using a matrix notation. An error analysis is presented that considers the effect of different methods used in the computation of the Fourier Transform coefficients as well as accumulated roundoff. New implementations of one and two-dimensional Fast Fourier Transforms are presented along with comparisons with existing methods. New algorithms for symmetric transforms are also developed, and the results show excellent speedup when implemented on the Intel iPSC hypercube.
- Research Organization:
- Cornell Univ., Ithaca, NY (USA)
- OSTI ID:
- 6308055
- Country of Publication:
- United States
- Language:
- English
Similar Records
A parallel implementation of 3-d CT image reconstruction on a hypercube multiprocessor
Performance modeling of parallel algorithms for solving neutron diffusion problems
Matrix factorization on a hypercube multiprocessor
Conference
·
Fri Jun 01 00:00:00 EDT 1990
· IEEE Transactions on Nuclear Science (Institute of Electrical and Electronics Engineers); (USA)
·
OSTI ID:6865791
Performance modeling of parallel algorithms for solving neutron diffusion problems
Journal Article
·
Mon May 01 00:00:00 EDT 1995
· Nuclear Science and Engineering
·
OSTI ID:79440
Matrix factorization on a hypercube multiprocessor
Conference
·
Thu Aug 01 00:00:00 EDT 1985
·
OSTI ID:5653196