Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers

DOI10.1007/BF00129773zbMath1187.65157OpenAlexW2025911710MaRDI QIDQ973414

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

zbMATH Keywords

supercomputervector processingFast Fourier transform

Mathematics Subject Classification ID

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)

Uses Software

• FFTPACK

Cites Work

• A high-performance fast Fourier transform algorithm for the Cray-2
• Multiprocessor FFTs
• Self-sorting mixed-radix fast Fourier transforms
• FFT algorithms for vector computers
• A segmented FFT algorithm for vector computers
• A Vector Implementation of the Fast Fourier Transform Algorithm
• An Algorithm for the Machine Calculation of Complex Fourier Series
• An Adaptation of the Fast Fourier Transform for Parallel Processing

This page was built for publication: Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers