PERFORMANCE ANALYSIS OF A PARALLEL FFT ALGORITHM ON A TRANSPUTER NETWORK

DOI10.1080/10637199408915458zbMath1049.68541OpenAlexW1992696980MaRDI QIDQ4820039

V. Lakshmi Narasimhan, Anthony Symons, Kurt Sterzl

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199408915458

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• A parallel FFT on an MIMD machine
• FFT algorithms for vector computers
• A parallel FFT algorithm for transputer networks
• The Implementation of Fast Radix 2 Transforms on Array Processors
• Index mappings for multidimensional formulation of the DFT and convolution
• An Adaptation of the Fast Fourier Transform for Parallel Processing

This page was built for publication: PERFORMANCE ANALYSIS OF A PARALLEL FFT ALGORITHM ON A TRANSPUTER NETWORK