Parallelisation of a 2-D Fast Fourier Transform Algorithm

Andrew Hammersley
Additional contact information
Andrew Hammersley: European Synchrotron Radiation Facility, BP 220, F-38043, Grenoble Cedex, France

International Journal of Modern Physics C (IJMPC), 1991, vol. 02, issue 01, 363-366

Abstract: The calculation of two and higher-dimension Fast Fourier Transforms (FFT’s) are of great importance in many areas of data analysis and computational physics. The two-dimensional FFT is implemented for a parallel network using a master-slave approach. In-place performance is good, but the use of this technique as an “accelerator” is limited by the communications time between the host and the network. The total time is reduced by performing the host-master communications in parallel with the master-slave communications. Results for the calculation of the two-dimensional FFT of real-valued datasets are presented.

Keywords: Parallel algorithms; Fast Fourier Transform (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183191000494
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:02:y:1991:i:01:n:s0129183191000494

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183191000494

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().