NDLI: Two-step 1-D fast Fourier transform without inter-processor communications

Content Provider	IEEE Xplore Digital Library
Author	Na'mneh, R.A. Pan, D.W.
Copyright Year	2006
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Alabama Univ., Huntsville, AL (Na'mneh, R.A.; Pan, D.W.)
Abstract	Computing the 1-D fast Fourier transform (FFT) using the conventional six-step FFT on parallel computers requires intensive all-to-all communication due to the necessity of transposing an array three times. This all-to-all communication significantly reduces the performance of FFT in parallel systems. In this paper, we present a two-step parallel algorithm for implementing the 1-D FFT without inter-processor communication, at the expense of extra computation as opposed to the conventional six-step FFT. The advantage of the two-step FFT algorithm over its six-step counterpart becomes obvious in systems where the cost of computation is lower that of inter-processor communication. The 32-node Beowulf cluster is such a system with fast 2 GHz processors but relatively slow inter-processor communication by using 100 Mbit/s network switches. Our simulation results show that the two-step FFT algorithm without inter-processor communication outperforms the six-step 1-D FFT on this cluster
Starting Page	529
Ending Page	533
File Size	133331
Page Count	5
File Format	PDF
ISBN	0780394577
DOI	10.1109/SSST.2006.1619115
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-03-05
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Fast Fourier transforms Clustering algorithms Concurrent computing Switches Communication switching Hypercubes Scalability Parallel algorithms Computational efficiency Telecommunication switching
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Parallel implementation of 1-D fast Fourier transform without inter-processor communications

Supercomputing challenges in electromagnetics

A parallel algorithm for computing Fourier transforms on the star graph

Fast computation of two-dimensional discrete Fourier transform using fast discrete Radon transform

All-to-All Personalized Exchange Algorithms in Generalized Shuffle-Exchange Networks

On the scalability of FFT on parallel computers

A new parallel algorithm for the multidimensional Fourier transform processing

A Parallel FFT Scheme Based on Multi-Machines Environment

Parallel Power-of-Two FFTs on Hypercubes

Two-step 1-D fast Fourier transform without inter-processor communications

Similar Documents

Parallel implementation of 1-D fast Fourier transform without inter-processor communications

Supercomputing challenges in electromagnetics

A parallel algorithm for computing Fourier transforms on the star graph

Fast computation of two-dimensional discrete Fourier transform using fast discrete Radon transform

All-to-All Personalized Exchange Algorithms in Generalized Shuffle-Exchange Networks

On the scalability of FFT on parallel computers

A new parallel algorithm for the multidimensional Fourier transform processing

A Parallel FFT Scheme Based on Multi-Machines Environment

Parallel Power-of-Two FFTs on Hypercubes

Two-step 1-D fast Fourier transform without inter-processor communications