RT info:eu-repo/semantics/article
T1 The inherent overlapping in the parallel calculation of the Laplacian
A1 Sánchez Curto, Julio
AB A new approach for the parallel computation of the Laplacian in the Fourier domain is presented. Thisnumerical problem inherits the intrinsic sequencing involved in the calculation of any multidimensional Fast Fourier Transform (FFT) where blocking communications assure that its computation is strictly carried out dimension by dimension. Such data dependency vanishes when one considers the Laplacian as the sum of n independent one-dimensional kernels, so that computation and communication can be naturally overlappedwith nonblocking communications. Overlapping is demonstrated to be responsible for the speedup figures we obtain when our approach is compared to state-of-the-art parallel multidimensional FFTs.
YR 2023
FD 2023
LK https://uvadoc.uva.es/handle/10324/64977
UL https://uvadoc.uva.es/handle/10324/64977
LA eng
NO Journal of Computational Science, ISSN: 1877-7503, Vol: 67, Page: 101945
DS UVaDOC
RD 22-nov-2024