Batched Cholesky Factorization for tiny matrices - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Batched Cholesky Factorization for tiny matrices

Résumé

Many linear algebra libraries, such as the Intel MKL, Magma or Eigen, provide fast Cholesky factorization. These libraries are suited for big matrices but perform slowly on small ones. Even though State-of-the-Art studies begin to take an interest in small matrices, they usually feature a few hundreds rows. Fields like Computer Vision or High Energy Physics use tiny matrices. In this paper we show that it is possible to speedup the Cholesky factorization for tiny matrices by grouping them in batches and using highly specialized code. We provide High Level Transformations that accelerate the factorization for current Intel SIMD architectures (SSE, AVX2, KNC, AVX512). We achieve with these transformations combined with SIMD a speedup from 13 to 31 for the whole resolution compared to the naive code on a single core AVX2 machine and a speedup from 15 to 33 with multithreading compared to the multithreaded naive code.
Fichier principal
Vignette du fichier
dasip_2016_final_draft.pdf (587.76 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01361204 , version 1 (06-09-2016)

Identifiants

  • HAL Id : hal-01361204 , version 1

Citer

Florian Lemaitre, Lionel Lacassagne. Batched Cholesky Factorization for tiny matrices. Design and Architectures for Signal and Image Processing (DASIP), ECSI, Oct 2016, Rennes, France. pp.1--8. ⟨hal-01361204⟩
232 Consultations
633 Téléchargements

Partager

Gmail Facebook X LinkedIn More