Communication efficient multi-processor FFT

DOI10.1016/0021-9991(92)90380-HzbMATH Open0765.65129OpenAlexW2037680316MaRDI QIDQ1201720FDOQ1201720

Authors: S. Lennart Johnsson, Michel Jacquemin, Robert L. Krawitz 

Publication date: 17 January 1993

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9991(92)90380-h

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

zbMATH Keywords

fast Fourier transformBoolean cube networksefficient multiprocessor algorithms

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Distributed algorithms (68W15) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for specific classes of architectures (65Y10)

Cites Work

• Title not available (Why is that?)
• Optimum broadcasting and personalized communication in hypercubes
• Title not available (Why is that?)
• Multiprocessor FFTs
• Title not available (Why is that?)
• Solving Tridiagonal Systems on Ensemble Architectures
• Algorithms for Matrix Transposition on Boolean N-Cube Configured Ensemble Architectures

Cited In (7)

• Minimizing Communication in the Multidimensional FFT
• Cooley-Tukey FFT on the Connection Machine
• Multiprocessor FFTs
• Compression using efficient multicasting
• A distributed memory algorithm for 3-D FFTs
• Congruent Number Theta Coefficients to 1012
• Further Symmetries of in-Place FFTs

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)