Skip to main content

Comparison of MIMD and SIMT Parallel Iterative Solvers for Laplace's Equation


Abstract A comparison of the performance of CUDA versus OpenMP for Jacobi, Gauss-Seidel, and S.O.R. iterative methods for Laplace's Equation with Dirichlet boundary conditions is presented. Both the number of cores and the grid size were varied for the OpenMP program, while the grid size was varied for the CUDA program. CUDA outperforms the 8-core OpenMP program with the Jacobi and Gauss-Seidel schemes for all grid sizes, and is competitive with S.O.R for all grid sizes examined.
Created Date 2013-05
Contributor Prost, Spencer Arthur (Author) / Gardner, Carl (Thesis Director) / Welfert, Bruno (Committee Member) / Speyer, Gil (Committee Member) / Barrett, The Honors College / Computer Science and Engineering Program
Subject Successive Over Relaxation / Parallel Numerical Methods / Gauss Seidel / OpenMP / Jacobi / SIMT / GPU / Partial Differential Equations / Laplace's Equation
Series Academic Year 2012-2013
Type Text
Extent 25 pages
Language English
Copyright
Reuse Permissions All Rights Reserved
Collaborating Institutions Barrett, the Honors College
Additional Formats MODS / OAI Dublin Core / RIS


  Prost_S_Spring_2013.pdf
733.5 KB application/pdf
  • Download restricted to ASU - Sign In
Download Count: 3