Parallel dense gauss-seidel algorithm on many-core processors

Hadrien Courtecuisse 1 Jérémie Allard 1
1 SHACRA - Simulation in Healthcare using Computer Research Advances
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe, Inria Nancy - Grand Est
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-00841571
Contributor : Jeremie Dequidt <>
Submitted on : Friday, July 5, 2013 - 10:45:47 AM
Last modification on : Thursday, February 21, 2019 - 10:52:54 AM

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

350