A distributed memory algorithm for 3-D FFTs

The present paper begins with a survey of various up-to-date parallel 3-D FFT algorithms and proposes an algorithm for the parallel in-place 3-D FFTs on distributed memory architectures. In the described algorithm, the calculation is accomplished by partitioning the three-dimensional input tensor in...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of computational and applied mathematics Ročník 66; číslo 1; s. 139 - 151
Hlavní autoři: Costian, Calin R., Marinescu, Dan C.
Médium: Journal Article Konferenční příspěvek
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.01.1996
Elsevier
Témata:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Fourier analysis
Mathematics
Numerical analysis
Numerical analysis. Scientific computation
Sciences and techniques of general use
Theoretical computing
Distributed memory
Three-dimensional calculations
Fast Fourier transforms
Distributed algorithm
ISSN:0377-0427, 1879-1778
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The present paper begins with a survey of various up-to-date parallel 3-D FFT algorithms and proposes an algorithm for the parallel in-place 3-D FFTs on distributed memory architectures. In the described algorithm, the calculation is accomplished by partitioning the three-dimensional input tensor into subtensors (one subtensor per node). The dimensions of the tensor need not be powers of 2, although some requirements related to the number of nodes need to be fulfilled. The computation of local FFTs is then carried out using the Divide-and-Conquer method and results are combined to obtain the final result using a data partitioning strategy to minimize the communication between the nodes. The paper is concluded with a comparative discussion of the described algorithm and other parallel 3-D FFT algorithms, with respect to data partitioning, time complexity, communication complexity, memory requirements, how does the shape of the three-dimensional input affect the efficiency of the computation, etc. An implementation of the described algorithm has been tested on an iPSC/860 system and on a 2-D mesh, the Touchstone Delta system.
Bibliografie:SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISSN:0377-0427
1879-1778
DOI:10.1016/0377-0427(95)00163-8