Optimizing a parallel fast Fourier transform

Parallel computing, especially cluster computing has become more popular and more powerful in recent years. Star-P is a means of harnessing that power by eliminating the difficulties in parallelizing code and by providing the user with a familiar and intuitive interface. This paper presents methods to create a parallel FFT module for Star-P. We find that because calculating a parallel FFT is more communication-intensive than processor-intensive, clever planning and distribution of data is needed to achieve speed-up in a parallel environment.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2004

Author dc:creator

• Hu, Richard, 1982-

Advisor dc:contributor.advisor

• Alan Edelman.

• Electrical Engineering and Computer Science.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

en_US

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/28404

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/28404