Multithreaded algorithms for the fast Fourier transform

Authors:
Parimala Thulasiraman;Kevin B. Theobald;Ashfaq A. Khokhar;Guang R. Gao
Affiliations:
Department of Electrical and Computer Engineering, 140 Evans Hall, University of Delaware, Newark, DE;Department of Electrical and Computer Engineering, 140 Evans Hall, University of Delaware, Newark, DE;Department of Electrical and Computer Engineering, 140 Evans Hall, University of Delaware, Newark, DE;Department of Electrical and Computer Engineering, 140 Evans Hall, University of Delaware, Newark, DE
Venue:
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Year:
2000

Citing 10
Cited 2

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Computational frameworks for the fast Fourier transform

Computational frameworks for the fast Fourier transform
Introduction to parallel computing: design and analysis of algorithms

Introduction to parallel computing: design and analysis of algorithms
Parallel algorithms: for digital image processing, computer vision and neural networks

Parallel algorithms: for digital image processing, computer vision and neural networks
A study of the EARTH-MANNA multithreaded system

International Journal of Parallel Programming - Special issue on parallel architectures and compilation techniques—part II
Fine-grain multithreading with the EM-X multiprocessor

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Computer architecture (2nd ed.): a quantitative approach

Computer architecture (2nd ed.): a quantitative approach
An Adaptation of the Fast Fourier Transform for Parallel Processing

Journal of the ACM (JACM)
Advanced Computer Architecture: Parallelism,Scalability,Programmability

Advanced Computer Architecture: Parallelism,Scalability,Programmability
Costs and Benefits of Multithreading with Off-the-Shelf RISC Processors

Euro-Par '95 Proceedings of the First International Euro-Par Conference on Parallel Processing

Performance Evaluation of a Multithreaded Fast Fourier Transform Algorithm for Derivative Pricing

The Journal of Supercomputing
Performance portability on EARTH: a case study across several parallel architectures

Cluster Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present fine-grained multithreaded algorithms and implementations for the Fast Fourier Transform (FFT) problem. The FFT problem has been formulated using two distinct approaches based on the dataflow concepts. The first approach, referred to as the receiver-initiated algorithm, realizes the FFAT iterations as a parent-child relationship while fully exploiting the underlying parallelism. The second approach, referred to as the sender-initiated algorithm, follows a data-flow model based on the producer-consumer style of programming and can be adopted to different architectural parameters for achieving high performance. The implementations of the proposed algorithms have been carried out on the EARTH (Efficient Architecture for Running THreads) platform. For both the algorithms, we analyze the ratio of remote vs local threads and study its impact on the experimental results. Our implementation results show that for certain block sizes on fixed problem size and machine size, the receiver-initiated approach performs better than the sender-initiated approach. For large number of processors, both the algorithms perform well, yielding execution times of only 10 msec for an input of 16 K data points on a 64 processor machine, assuming each processor running at 140 MHz clock speed.