Efficient implementation of multidimensional fast fourier transform on a distributedmemory parallel multinode computer
Abstract
The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multinode computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first onedimensional FFT; performing the first onedimensional FFT on the elements of the array distributed at each node in the first dimension; redistributing the onedimensional FFTtransformed elements at each node in a second dimension via "alltoall" distribution in random order across other nodes of the computer system over the network; and performing a second onedimensional FFT on elements of the array redistributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The "alltoall" redistribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributedmemory parallel supercomputer.
 Inventors:

 Princeton, NJ
 CrotonOnHudson, NY
 Mount Kisco, NY
 Irvington, NY
 Cortlandt Manor, NY
 Bedford Hills, NY
 Publication Date:
 Research Org.:
 Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
 Sponsoring Org.:
 USDOE
 OSTI Identifier:
 1035037
 Patent Number(s):
 8,095,585
 Application Number:
 11/931,898
 Assignee:
 International Business Machines Corporation (Armonk, NY)
 DOE Contract Number:
 W7405ENG48
 Resource Type:
 Patent
 Country of Publication:
 United States
 Language:
 English
 Subject:
 97 MATHEMATICS AND COMPUTING
Citation Formats
Bhanot, Gyan V, Chen, Dong, Gara, Alan G, Giampapa, Mark E, Heidelberger, Philip, SteinmacherBurow, Burkhard D, and Vranas, Pavlos M. Efficient implementation of multidimensional fast fourier transform on a distributedmemory parallel multinode computer. United States: N. p., 2012.
Web.
Bhanot, Gyan V, Chen, Dong, Gara, Alan G, Giampapa, Mark E, Heidelberger, Philip, SteinmacherBurow, Burkhard D, & Vranas, Pavlos M. Efficient implementation of multidimensional fast fourier transform on a distributedmemory parallel multinode computer. United States.
Bhanot, Gyan V, Chen, Dong, Gara, Alan G, Giampapa, Mark E, Heidelberger, Philip, SteinmacherBurow, Burkhard D, and Vranas, Pavlos M. 2012.
"Efficient implementation of multidimensional fast fourier transform on a distributedmemory parallel multinode computer". United States. https://www.osti.gov/servlets/purl/1035037.
@article{osti_1035037,
title = {Efficient implementation of multidimensional fast fourier transform on a distributedmemory parallel multinode computer},
author = {Bhanot, Gyan V and Chen, Dong and Gara, Alan G and Giampapa, Mark E and Heidelberger, Philip and SteinmacherBurow, Burkhard D and Vranas, Pavlos M},
abstractNote = {The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multinode computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first onedimensional FFT; performing the first onedimensional FFT on the elements of the array distributed at each node in the first dimension; redistributing the onedimensional FFTtransformed elements at each node in a second dimension via "alltoall" distribution in random order across other nodes of the computer system over the network; and performing a second onedimensional FFT on elements of the array redistributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The "alltoall" redistribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributedmemory parallel supercomputer.},
doi = {},
url = {https://www.osti.gov/biblio/1035037},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2012},
month = {1}
}
Works referenced in this record:
Packet Routing in FixedConnection Networks: A Survey
journal, November 1998
 Grammatikakis, Miltos D.; Hsu, D. Frank; Kraetzl, Miro
 Journal of Parallel and Distributed Computing, Vol. 54, Issue 2
Methods for message routing in parallel machines
conference, January 1992
 Leighton, Tom
 Proceedings of the twentyfourth annual ACM symposium on Theory of computing  STOC '92