Parallel dense gauss-seidel algorithm on many-core processors - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Parallel dense gauss-seidel algorithm on many-core processors


The Gauss-Seidel method is very efficient for solving problems such as tightly-coupled constraints with possible redundancies. However, the underlying algorithm is inherently sequential. Previous works have exploited sparsity in the system matrix to extract parallelism. In this paper, we propose to study several parallelization schemes for fully-coupled systems, unable to be parallelized by existing methods, taking advantage of recent many-cores architectures offering fast synchronization primitives. Experimental results on both multi-core CPUs and recent GPUs show that our proposed method is able to fully exploit the available units, whereas trivial parallel algorithms often fail. This method is illustrated by an application in medical intervention planning, where it is used to solve a linear complementary problem (LCP) expressing the contacts applied to a deformable body.
No file

Dates and versions

hal-00841571 , version 1 (05-07-2013)



Hadrien Courtecuisse, Jérémie Allard. Parallel dense gauss-seidel algorithm on many-core processors. HPCC'09 - 11th IEEE International Conference on High Performance Computing and Communications - 2009, Jun 2009, Seoul, South Korea. pp.139--147, ⟨10.1109/HPCC.2009.51⟩. ⟨hal-00841571⟩
237 View
0 Download



Gmail Facebook Twitter LinkedIn More