Parallel Fast Multipole Method accelerated FFT on HPC clusters

With increasing sizes of distributed systems, there comes an increased risk of communication bottlenecks. In the past decade there has been a growing interest in communication-avoiding algorithms. The distributed memory Fast Fourier Transform is an important algorithm which suffers from major commun...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Parallel computing Jg. 104-105; S. 102783
Hauptverfasser:	Mehta, Chahak, Karthi, Amarnath, Jetly, Vishrut, Chaudhury, Bhaskar
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.07.2021
Schlagworte:	Beowulf cluster Communication avoiding algorithms Fast Fourier Transform Fast Multipole Method High performance computing Parallel programming Fast Fourier Transform Fast Multipole Method Parallel programming Communication avoiding algorithms High performance computing Beowulf cluster
ISSN:	0167-8191, 1872-7336
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!