Communication efficient multi-processor FFT
From MaRDI portal
Publication:1201720
Recommendations
- Cooley-Tukey FFT on the Connection Machine
- Implementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communication
- Multiprocessor FFTs
- FFT algorithms and their adaptation to parallel processing
- FAST FOURIER TRANSFORM ALGORITHM DESIGN AND TRADEOFFS ON THE CM-2
Cites work
- scientific article; zbMATH DE number 3967873 (Why is no real title available?)
- scientific article; zbMATH DE number 3752234 (Why is no real title available?)
- scientific article; zbMATH DE number 3577138 (Why is no real title available?)
- Algorithms for Matrix Transposition on Boolean N-Cube Configured Ensemble Architectures
- Multiprocessor FFTs
- Optimum broadcasting and personalized communication in hypercubes
- Solving Tridiagonal Systems on Ensemble Architectures
Cited in
(8)- Cooley-Tukey FFT on the Connection Machine
- Multiprocessor FFTs
- Further Symmetries of in-Place FFTs
- Congruent Number Theta Coefficients to 1012
- A distributed memory algorithm for 3-D FFTs
- Minimizing Communication in the Multidimensional FFT
- A highly efficient FFT using shared-memory multiplexing
- Compression using efficient multicasting
This page was built for publication: Communication efficient multi-processor FFT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201720)