发明名称 |
Efficient implementation of a multidimensional fast fourier transform on a distributed-memory parallel multi-node computer |
摘要 |
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.
|
申请公布号 |
US7315877(B2) |
申请公布日期 |
2008.01.01 |
申请号 |
US20030468998 |
申请日期 |
2003.08.22 |
申请人 |
INTERNATIONAL BUSINESS MACHINES CORPORATION |
发明人 |
BHANOT GYAN V.;CHEN DONG;GARA ALAN G.;GIAMPAPA MARK E.;HEIDELBERGER PHILIP;STEINMACHER-BUROW BURKHARD D.;VRANAS PAVLOS M. |
分类号 |
G06F11/10;G06F17/14;G06F9/46;G06F9/52;G06F11/00;G06F11/20;G06F12/00;G06F12/02;G06F12/08;G06F12/10;G06F13/00;G06F13/24;G06F13/38;G06F15/173;G06F15/177;G06F15/80;H04L1/00;H04L7/02;H04L7/033;H04L12/28;H04L12/56;H04L25/02;H05K7/20 |
主分类号 |
G06F11/10 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|