skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Efficient implementation of multidimensional fast fourier transform on a distributed-memory parallel multi-node 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 multi-node 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 one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributing the one-dimensional FFT-transformed elements at each node in a second dimension via "all-to-all" distribution in random order across other nodes of the computer system over the network; and performing a second one-dimensional FFT on elements of the array re-distributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The "all-to-all" re-distribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributed-memory parallel supercomputer.

Inventors:
 [1];  [2];  [3];  [4];  [5];  [3];  [6]
  1. Princeton, NJ
  2. Croton-On-Hudson, NY
  3. Mount Kisco, NY
  4. Irvington, NY
  5. Cortlandt Manor, NY
  6. 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) LLNL
DOE Contract Number:
W-7405-ENG-48
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, Steinmacher-Burow, Burkhard D, and Vranas, Pavlos M. Efficient implementation of multidimensional fast fourier transform on a distributed-memory parallel multi-node computer. United States: N. p., 2012. Web.
Bhanot, Gyan V, Chen, Dong, Gara, Alan G, Giampapa, Mark E, Heidelberger, Philip, Steinmacher-Burow, Burkhard D, & Vranas, Pavlos M. Efficient implementation of multidimensional fast fourier transform on a distributed-memory parallel multi-node computer. United States.
Bhanot, Gyan V, Chen, Dong, Gara, Alan G, Giampapa, Mark E, Heidelberger, Philip, Steinmacher-Burow, Burkhard D, and Vranas, Pavlos M. Tue . "Efficient implementation of multidimensional fast fourier transform on a distributed-memory parallel multi-node computer". United States. doi:. https://www.osti.gov/servlets/purl/1035037.
@article{osti_1035037,
title = {Efficient implementation of multidimensional fast fourier transform on a distributed-memory parallel multi-node computer},
author = {Bhanot, Gyan V and Chen, Dong and Gara, Alan G and Giampapa, Mark E and Heidelberger, Philip and Steinmacher-Burow, 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 multi-node 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 one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributing the one-dimensional FFT-transformed elements at each node in a second dimension via "all-to-all" distribution in random order across other nodes of the computer system over the network; and performing a second one-dimensional FFT on elements of the array re-distributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The "all-to-all" re-distribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributed-memory parallel supercomputer.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Jan 10 00:00:00 EST 2012},
month = {Tue Jan 10 00:00:00 EST 2012}
}

Patent:

Save / Share: