Multiprocessor FFTs
type: Item
instance of: scholarly article
title: Multiprocessor FFTs
zbMATH Open document ID: 0624.65146
DOI: 10.1016/0167-8191(87)90018-4
author: Paul N. Swarztrauber
published in: Parallel Computing
publication date: 1987-01-01T00:00:00Z
review text: Several vector component fast Fourier transforms (FFT) are developed for both shared and non-shared multiprocessors. The focus is mainly on the efficiency of the movement of data. First eight FFTs algorithms are reviewed and then they are used to develop two FFTs for vector multiprocessors with shared memory. In the case of the hypercube FFTs, the emphasis is on algorithms which minimize interprocessors communication.
Mathematics Subject Classification ID: 65T40
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 42A15
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 4013983
zbMATH Keywords: fast Fourier transforms
zbMATH Keywords: multiprocessors
zbMATH Keywords: algorithms
zbMATH Keywords: shared memory
zbMATH Keywords: hypercube FFTs
reviewed by: Guy Jumarie
MaRDI profile type: Publication
full work available at URL: 0167-8191(87)90018-4
OpenAlex ID: W4256206162
description: scientific article; zbMATH DE number 4013983