Abstract
Fast Poisson solvers based on fast Fourier transform (FFT) computations are among the fastest techniques to solve Poisson equation on uniform grids. In this paper, the authors present two parallel distributed implementations of a 3-D fast Poisson solver in the context of the atmospheric simulation code. The first approach consists of implementing data movement between each computational step so that no elementary computational routine involves communication. The second approach aims at reducing the global data movement and requires the parallelization of one step of the fast Poisson solver. Experimental results on a 128-node Cray T3E are presented to illustrate the advantages and drawbacks of each approach.
Get full access to this article
View all access options for this article.
