Computer Science – Mathematical Software
Scientific paper
2010-02-22
Computer Science
Mathematical Software
8 pages, extended abstract submitted to VecPar10 on 12/11/09, notification of acceptance received on 02/05/10. See: http://v
Scientific paper
The algorithms in the current sequential numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multicore architectures. A new family of algorithms, the tile algorithms, has recently been introduced. Previous research has shown that it is possible to write efficient and scalable tile algorithms for performing a Cholesky factorization, a (pseudo) LU factorization, and a QR factorization. In this extended abstract, we attack the problem of the computation of the inverse of a symmetric positive definite matrix. We observe that, using a dynamic task scheduler, it is relatively painless to translate existing LAPACK code to obtain a ready-to-be-executed tile algorithm. However we demonstrate that non trivial compiler techniques (array renaming, loop reversal and pipelining) need then to be applied to further increase the parallelism of our application. We present preliminary experimental results.
Agullo Emmanuel
Bouwmeester Henricus
Dongarra Jack
Kurzak Jakub
Langou Julien
No associations
LandOfFree
Towards an Efficient Tile Matrix Inversion of Symmetric Positive Definite Matrices on Multicore Architectures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Towards an Efficient Tile Matrix Inversion of Symmetric Positive Definite Matrices on Multicore Architectures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards an Efficient Tile Matrix Inversion of Symmetric Positive Definite Matrices on Multicore Architectures will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-373217