Resolution of a large number of small random symmetric linear systems in single precision arithmetic on GPUs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Supercomputing Année : 2017

Resolution of a large number of small random symmetric linear systems in single precision arithmetic on GPUs

Résumé

This paper focuses on the resolution of a large number of small symmetric linear systems and its parallel implementation on single precision on GPUs. The computations involved by each linear system are independent from the others and the number of unknowns does not exceed 64. For this purpose, we present the adaptation to our context of largely used methods that include: LDLt, House-holder reduction to a tridiagonal matrix, parallel cyclic reduction that is not a power of two and the divide and conquer algorithm for tridiagonal eigenprob-lems. We not only detail the implementation and optimization of each method but we also compare the sustainability of each solution and its performance which include both parallel complexity and cache memory occupation. In the context of solving a large number of small random linear systems on GPU with no information about their conditioning, we show that the best strategy seems to be the use of Householder tridiagonalization + PCR followed if necessary by a divide & conquer diagonalization.
Fichier principal
Vignette du fichier
LokmanStef.pdf (348.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01295549 , version 1 (31-03-2016)

Identifiants

Citer

Lokman A. Abbas-Turki, Stef Graillat. Resolution of a large number of small random symmetric linear systems in single precision arithmetic on GPUs. Journal of Supercomputing, 2017, 73 (4), pp.1360-1386. ⟨10.1007/s11227-016-1813-9⟩. ⟨hal-01295549⟩
242 Consultations
354 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More