Exploiting Generic Tiled Algorithms Toward Scalable H-Matrices Factorizations on Top of Runtime Systems - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Exploiting Generic Tiled Algorithms Toward Scalable H-Matrices Factorizations on Top of Runtime Systems

(1) , (2) , (3) , (4) , (2, 5)
1
2
3
4
5

Abstract

Hierarchical matrices (H-matrices) have become important in applications where accuracy can be reduced to decrease to a logarithmic order both the execution time and memory consumption. It happens for instance when solving Boundary Element Methods (BEM) problems. However the natural hierarchical structure of the H-Matrices makes it more difficult to efficiently parallelize with modern programming paradigm such as task-based implementations. We discuss in this presentation how we can combine, Chameleon, a tiled dense linear algebra software relying on sequential task-based algorithms and runtime systems such as StarPU, and Hmat-oss, a library focused on providing a set of sequential algorithms for H-algebra operations. We will discuss the limitations in terms of H-matrices structure and memory compression that are imposed by the use of a tiled algorithm, and we will show the performance that can be brought by such a generic solution with respect to more advanced implementation fully exploiting the hierarchical data structure.
Not file

Dates and versions

hal-03149953 , version 1 (23-02-2021)

Identifiers

  • HAL Id : hal-03149953 , version 1

Cite

Rocío Carratalá-Sáez, Mathieu Faverge, Grégoire Pichon, Enrique Salvador Quintana-Ortí, Guillaume Sylvand. Exploiting Generic Tiled Algorithms Toward Scalable H-Matrices Factorizations on Top of Runtime Systems. SIAM PP20 - SIAM Conference on Parallel Processing for Scientific Computing, Feb 2020, Seattle, United States. ⟨hal-03149953⟩
46 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More