Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


10400.pdf (1013.95 KB)

ETD Abstract Container

Abstract Header

A Fast Poisson Solver with Periodic Boundary Conditions for GPU Clusters in Various Configurations

Rattermann, Dale N
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1397233840

Abstract Details

2014, MS, University of Cincinnati, Engineering and Applied Science: Aerospace Engineering.
Fast Poisson solvers using the Fast Fourier Transform on uniform grids are especially suited for parallel implementation, making them appropriate for portability on graphical processing unit (GPU) devices. The goal of the following work was to implement, test, and evaluate a fast Poisson solver for periodic boundary conditions for use on a variety of GPU configurations. The solver used in this research was FLASH, an immersed-boundary-based method, which is well suited for complex, time-dependent geometries, has robust adaptive mesh refinement/de-refinement capabilities to capture evolving flow structures, and has been successfully implemented on conventional, parallel supercomputers. However, these solvers are still computationally costly to employ, and the total solver time is dominated by the solution of the pressure Poisson equation using state-of-the-art multigrid methods. FLASH improves the performance of its multigrid solvers by integrating a parallel FFT solver on a uniform grid during a coarse level. This hybrid solver could then be theoretically improved by replacing the highly-parallelizable FFT solver with one that utilizes GPUs, and, thus, was the motivation for my research. In the present work, the CPU-utilizing parallel FFT solver (PFFT) used in the base version of FLASH for solving the Poisson equation on uniform grids has been modified to enable parallel execution on CUDA-enabled GPU devices. New algorithms have been implemented to replace the Poisson solver that decompose the computational domain and send each new block to a GPU for parallel computation. One-dimensional (1-D) decomposition of the computational domain minimizes the amount of network traffic involved in this bandwidth-intensive computation by limiting the amount of all-to-all communication required between processes. Advanced techniques have been incorporated and implemented in a GPU-centric code design, while allowing end users the flexibility of parameter control at runtime in order to maximize throughput with all data sizes. The new code also allows the use of multiple GPU devices in a variety of configurations. The elapsed solution time for the newly implemented GPU-based solvers for a Poisson equation with known source terms demonstrate speed-ups of up to 3.5 times faster than the CPU-based solver.
Kirti Ghia, Ph.D. (Committee Chair)
Bracy Elton, Ph.D (Committee Member)
Shaaban Abdallah, Ph.D. (Committee Member)
Urmila Ghia, Ph.D. (Committee Member)
60 p.
Aerospace Materials
GPU; Poisson; Incompressible; CFD; FFT; CUDA

Recommended Citations

Citations

  • Rattermann, D. N. (2014). A Fast Poisson Solver with Periodic Boundary Conditions for GPU Clusters in Various Configurations [Master's thesis, University of Cincinnati]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1397233840

    APA Style (7th edition)

  • Rattermann, Dale. A Fast Poisson Solver with Periodic Boundary Conditions for GPU Clusters in Various Configurations. 2014. University of Cincinnati, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ucin1397233840.

    MLA Style (8th edition)

  • Rattermann, Dale. "A Fast Poisson Solver with Periodic Boundary Conditions for GPU Clusters in Various Configurations." Master's thesis, University of Cincinnati, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1397233840

    Chicago Manual of Style (17th edition)

ucin1397233840
1,415
© 2014, all rights reserved.
This open access ETD is published by University of Cincinnati and OhioLINK.