1385

Parallel Sparse Matrix Solver on the GPU Applied to Simulation of Electrical Machines

Antonio Wendell De Oliveira Rodrigues, Frederic Guyomarch, Yvonnick Le Menach, Jean-Luc Dekeyser
LIFL – USTL, INRIA Lille Nord Europe – 59650, Villeneuve d’Ascq – France
arXiv:1010.4639v1 [cs.DC] (22 Oct 2010)

@article{de2009parallel,

   title={Parallel Sparse Matrix Solver on the GPU Applied to Simulation of Electrical Machines},

   author={De Oliveira Rodrigues, A.W. and Guyomarch, F. and Le Menach, Y. and Dekeyser, J.L.},

   year={2009}

}

Download Download (PDF)   View View   Source Source   

702

views

Nowadays, several industrial applications are being ported to parallel architectures. In fact, these platforms allow acquire more performance for system modelling and simulation. In the electric machines area, there are many problems which need speed-up on their solution. This paper examines the parallelism of sparse matrix solver on the graphics processors. More specifically, we implement the conjugate gradient technique with input matrix stored in CSR, and Symmetric CSR and CSC formats. This method is one of the most efficient iterative methods available for solving the finite-element basis functions of Maxwell’s equations. The GPU (Graphics Processing Unit), which is used for its implementation, provides mechanisms to parallel the algorithm. Thus, it increases significantly the computation speed in relation to serial code on CPU based systems.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: