FFTs on mesh connected computers

DOI10.1016/0167-8191(95)00062-3MaRDI QIDQ672101zbMATH OpenOpenAlexFDO

Authors F. Argüello, M. Amor, E. L. Zapata

Publication date 27 February 1997

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(95)00062-3

zbMATH Keywords

Distributed memory multiprocessorsDivide and conquer strategyFast Fourier TransformMesh connected computers

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for specific classes of architectures (65Y10)

Recommendations

• Two-dimensional FFT algorithms on hypercube and mesh machines
• Parallel FFT algorithms for mimd computers
• Multiprocessor FFTs
• Cooley-Tukey FFT on the Connection Machine
• FFT algorithms and their adaptation to parallel processing

Cited in

(2)

• A comparison of optimal FFTs on torus and hypercube multicomputers
• Multiprocessor FFTs

This page was built for publication: FFTs on mesh connected computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672101)