Abstract
The fast Poisson solvers based on FFT computations are among the fastest techniques to solve Poisson problems on uniform grids. In this paper, we present a parallel distributed implementation of a 3D fast Poisson solver in the context of the atmospheric simulation code Meso-NH [3]. This parallel implementation consists in implementing data movement between each computational step so that no elementary computational routine implements communication. Experimental results are given on a 128 node Cray T3E to illustrate the advantages of this method.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Giraud, L., Guivarch, R., Stein, J.: Parallel Distributed Fast 3D Poisson Solver for Meso-scale Atmospheric Simulation, CERFACS Technical Report, in preparation.
Gustafson, J., Montry, G., and, Benner, R.: Development of Parallel Methods for a 1024-Processor Hypercube, SIAM J. Sci. Stat. Comput., 9, 609–638, 1988.
Lafore, J.P., Stein, J., Asencio, N., Bougeault, P., Ducrocq, V., Duron, J., Fischer, C., Hereil, P., Mascart, P., Pinty, J.P., Redelsperger, J.L., Richard, E., and Vila-Guerau de Arellano, J.: The Meso-NH Atmospheric Simulation System, I, Adiabatic formulation and control simulations, Annales Geophysicae, 16, 90–109, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giraud, L., Guivarch, R., Stein, J. (1999). A Parallel Distributed Fast 3D Poisson Solver for Méso-NH. In: Amestoy, P., et al. Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48311-X_201
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_201
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66443-7
Online ISBN: 978-3-540-48311-3
eBook Packages: Springer Book Archive