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...

Celý popis

Podrobná bibliografie

Vydáno v:	Parallel computing Ročník 104-105; s. 102783
Hlavní autoři:	Mehta, Chahak, Karthi, Amarnath, Jetly, Vishrut, Chaudhury, Bhaskar
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.07.2021
Témata:	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
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!