Task-Parallel LU Factorization of Hierarchical Matrices Using OmpSs

Task-parallelism has been exposed as an efficient approach for the solution of dense and sparse linear algebra problems. Hierarchical matrices lie in-between the dense and sparse scenarios and, therefore, it is natural to target this niche of problems via a runtime-based solution that has reported s...

Full description

Bibliographic Details

Published in:	2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) pp. 1148 - 1157
Main Authors:	Aliaga, Jose I., Carratala-Saez, Rocio, Kriemann, Ronald, Quintana-Orti, Enrique S.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.05.2017
Subjects:	Electronic mail Hierarchical matrices (H-matrices) Indexes LU factorization Matrix decomposition multicore processors OmpSs Partitioning algorithms Programming Software Task-Parallelism
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!