José Ignacio Aliaga Estellés , Rocío Carratalá Sáez, Enrique Salvador Quintana Ortí
We present a prototype task-parallel algorithm for the solution of hierarchical symmetric positive definite linear systems via the H-Cholesky factorization that builds upon the parallel programming standards and associated runtimes for OpenMP and OmpSs. In contrast with previous efforts, our proposal decouples the numerical aspects of the linear algebra operation from the complexities associated with high performance computing. Our experiments make an exhaustive analysis of the efficiency attained by different parallelization approaches that exploit either task-parallelism or loop-parallelism via a runtime. Alternatively, we also evaluate a solution that leverages multi-threaded parallelism via the parallel implementation of the Basic Linear Algebra Subroutines BLAS in Intel MKL.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados