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

Full description

Bibliographic Details

Published in:	Parallel computing Vol. 104-105; p. 102783
Main Authors:	Mehta, Chahak, Karthi, Amarnath, Jetly, Vishrut, Chaudhury, Bhaskar
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.07.2021
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!