Parallel FFT algorithms for mimd computers
From MaRDI portal
DOI10.1049/EL:19910181zbMATH Open0715.65111OpenAlexW1986800633MaRDI QIDQ3201721FDOQ3201721
Authors:
Publication date: 1991
Published in: Electronics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1049/el:19910181
Recommendations
algorithmsparallel computingfast Fourier transformMIMD computerscyclic networkmemory requirementhost participationhypercube configurationspeed-up performance
Parallel numerical computation (65Y05) Numerical methods for discrete and fast Fourier transforms (65T50)
Cited In (16)
- An algorithm for distributed computation of FFTs
- A CUDA-MPI algorithm for the fast Fourier transform on the hexagon and its implementation
- Parallel Compact FFT<scp>s</scp> for Real Sequences
- High-performance radix-2, 3 and 5 parallel 1-D complex FFT algorithms for distributed-memory parallel computers
- Parallelization and Performance Analysis of the Cooley–Tukey FFT Algorithm for Shared-Memory Architectures
- FFT algorithms and their adaptation to parallel processing
- Title not available (Why is that?)
- Applications of conformal computing techniques to problems in computational physics: the fast Fourier transform
- Title not available (Why is that?)
- Scalable parallel FFT for spectral simulations on a Beowulf cluster
- A parallel FFT algorithm for transputer networks
- Two-dimensional FFT algorithms on hypercube and mesh machines
- Real and complex fast Fourier transforms on the Fujitsu VPP 500
- A multiple single-board-computer parallel processing system for speed-up of FFT implementation
- A parallel FFT on an MIMD machine
- FFTs on mesh connected computers
This page was built for publication: Parallel FFT algorithms for mimd computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3201721)
