Optimizing a parallel fast Fourier transform
Name
56985323-MIT.pdf
Description
Full printable version
Size
2.61 MB
Format
Adobe PDF
Checksum (MD5)
1e03c21fd8cd770dbe2520c22873753a
Author(s)
Hu, Richard, 1982-
Advisor(s)
Alan Edelman.
Date Issued
2004
Publisher
Massachusetts Institute of Technology
Abstract
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.
Description
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (p. 40).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
