Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers
DOI10.1007/BF00129773zbMATH Open1187.65157OpenAlexW2025911710MaRDI QIDQ973414FDOQ973414
Authors: David A. Carlson
Publication date: 31 May 2010
Published in: The Journal of Supercomputing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00129773
Recommendations
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for specific classes of architectures (65Y10)
Cites Work
- An Algorithm for the Machine Calculation of Complex Fourier Series
- FFT algorithms for vector computers
- Self-sorting mixed-radix fast Fourier transforms
- A Vector Implementation of the Fast Fourier Transform Algorithm
- A high-performance fast Fourier transform algorithm for the Cray-2
- An Adaptation of the Fast Fourier Transform for Parallel Processing
- Multiprocessor FFTs
- A segmented FFT algorithm for vector computers
Cited In (7)
- A high-performance fast Fourier transform algorithm for the Cray-2
- Title not available (Why is that?)
- Title not available (Why is that?)
- Four easy ways to a faster FFT
- Title not available (Why is that?)
- Implementation of a prime factor FFT algorithm on CRAY-1
- Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP
Uses Software
This page was built for publication: Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973414)