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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The International Journal of High Performance Computing Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
