2026-09-19T02:01:16Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/284042022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Alan Edelman.
Hu, Richard, 1982-
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2005-09-26T20:15:53Z
2005-09-26T20:15:53Z
2004
2004
http://hdl.handle.net/1721.1/28404
56985323
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (p. 40).
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.
by Richard Hu.
M.Eng.
40 p.
1477437 bytes
1479765 bytes
application/pdf
application/pdf
en_US
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Optimizing a parallel fast Fourier transform
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="399e58ba-0d27-4028-9f84-f9e74f05b3ff">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>en_US</Language>
<Title>Optimizing a parallel fast Fourier transform</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2004</PublicationDate>
<Authors>
<Author>
<DisplayName>Hu, Richard, 1982-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>