Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire du LRI
On the Challenges of GPU Computing for Sparse Linear Solvers
Karl Rupp

18 December 2012, 10h30 - 18 December 2012, 12h00
Salle/Bat : 455/PCRI-N
Contact : marc.baboulin@lri.fr

Activités de recherche :

Résumé :
While GPUs are well-established accelerators for dense linear
algebra, they have only been partially successful for the solution of linear systems represented by sparse matrices. An overview of GPU implementations of iterative solvers is given first, then the
challenges of efficient GPU-based preconditioners are discussed.
Subtle differences of the GPU computing frameworks CUDA and OpenCL are presented and library-aspects are introduced by the example of the free open-source library ViennaCL [1] and its current integration into PETSc [2].

[1] http://viennacl.sourceforge.net/
[2] http://www.mcs.anl.gov/petsc/

Pour en savoir plus :
Séminaires
Some recent results on the integer linear programm
Théorie des graphes
Friday 30 November 2018 - 00h00
Salle : 445 - PCRI-N
Hung Nguyen .............................................

Maximum Independent Set in H-free graphs
Théorie des graphes
Friday 05 October 2018 - 14h30
Salle : 445 - PCRI-N
Edouard BONNET .............................................

A Family of Tractable Graph Distances
Gestion de données du Web
Wednesday 04 July 2018 - 10h30
Salle : 465 - PCRI-N
Stratis Ioannidis .............................................

Binary pattern of length greater than 14 are abeli
Combinatoire
Friday 29 June 2018 - 14h30
Salle : 445 - PCRI-N
Matthieu Rosenfeld .............................................

Distributionally Robust Optimization with Principa
Optimisation combinatoire et stochastique
Friday 29 June 2018 - 11h00
Salle : 455 - PCRI-N
Dr. Jianqiang Cheng .............................................