Parallel Thomas approach development for solving tridiagonal systems in GPU programming − steady and unsteady flow simulation
| Autor: | Hossein Mahmoodi Darian, Pooria Akbarzadeh, Milad Souri |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
020203 distributed computing
Speedup Tridiagonal matrix Computer science Mechanical Engineering Parallel algorithm Tridiagonal matrix algorithm 010103 numerical & computational mathematics 02 engineering and technology Parallel computing System of linear equations 01 natural sciences Industrial and Manufacturing Engineering Square (algebra) 0202 electrical engineering electronic engineering information engineering General Materials Science Central processing unit 0101 mathematics General-purpose computing on graphics processing units |
| Zdroj: | Mechanics & Industry. 21:303 |
| ISSN: | 2257-7750 2257-7777 |
| DOI: | 10.1051/meca/2020013 |
| Popis: | The solution of tridiagonal system of equations using graphic processing units (GPU) is assessed. The parallel-Thomas-algorithm (PTA) is developed and the solution of PTA is compared to two known parallel algorithms, i.e. cyclic-reduction (CR) and parallel-cyclic-reduction (PCR). Lid-driven cavity problem is considered to assess these parallel approaches. This problem is also simulated using the classic Thomas algorithm that runs on a central processing unit (CPU). Runtimes and physical parameters of the mentioned GPU and CPU algorithms are compared. The results show that the speedup of CR, PCR and PTA against the CPU runtime is 4.4x,5.2x and 38.5x, respectively. Furthermore, the effect of coalesced and uncoalesced memory access to GPU global memory is examined for PTA, and a 2x-speedup is achieved for the coalesced memory access. Additionally, the PTA performance in a time dependent problem, the unsteady flow over a square, is assessed and a 9x-speedup is obtained against the CPU. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|