Communication efficient multi-processor FFT

DOI10.1016/0021-9991(92)90380-HzbMath0765.65129OpenAlexW2037680316MaRDI QIDQ1201720

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

zbMATH Keywords

fast Fourier transformBoolean cube networksefficient multiprocessor algorithms

Mathematics Subject Classification ID

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

Related Items (3)

A distributed memory algorithm for 3-D FFTs ⋮ Congruent Number Theta Coefficients to 1012 ⋮ Compression using efficient multicasting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiprocessor FFTs
• Solving Tridiagonal Systems on Ensemble Architectures
• Algorithms for Matrix Transposition on Boolean N-Cube Configured Ensemble Architectures
• Optimum broadcasting and personalized communication in hypercubes

This page was built for publication: Communication efficient multi-processor FFT