Divide and Conquer Symmetric Tridiagonal Eigensolver for Multicore Architectures - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Divide and Conquer Symmetric Tridiagonal Eigensolver for Multicore Architectures

Résumé

Computing eigenpairs of a symmetric matrix is a problem arising in many industrial applications, including quantum physics and finite-elements computation for automo-biles. A classical approach is to reduce the matrix to tridiagonal form before computing eigenpairs of the tridiagonal matrix. Then, a back-transformation allows one to obtain the final solution. Parallelism issues of the reduction stage have already been tackled in different shared-memory libraries. In this article, we focus on solving the tridiagonal eigenproblem, and we describe a novel implementation of the Divide and Conquer algorithm. The algorithm is expressed as a sequential task-flow, scheduled in an out-of-order fashion by a dynamic runtime which allows the programmer to play with tasks granularity. The resulting implementation is between two and five times faster than the equivalent routine from the INTEL MKL library, and outperforms the best MRRR implementation for many matrices.
Fichier principal
Vignette du fichier
dnc_submitted.pdf (535.44 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01078356 , version 1 (16-12-2014)
hal-01078356 , version 2 (24-02-2015)
hal-01078356 , version 3 (18-06-2015)

Identifiants

  • HAL Id : hal-01078356 , version 1

Citer

Grégoire Pichon, Azzam Haidar, Mathieu Faverge, Jakub Kurzak. Divide and Conquer Symmetric Tridiagonal Eigensolver for Multicore Architectures. 29th IEEE International Parallel & Distributed Processing Symposium, May 2015, Hyderabad, India. ⟨hal-01078356v1⟩
538 Consultations
981 Téléchargements

Partager

Gmail Facebook X LinkedIn More