MiS Preprint Repository

Delve into the future of research at MiS with our preprint repository. Our scientists are making groundbreaking discoveries and sharing their latest findings before they are published. Explore repository to stay up-to-date on the newest developments and breakthroughs.

MiS Preprint

Semi-Automatic Task Graph Construction for H-Matrix Arithmetic

Steffen Börm, Sven Christophersen and Ronald Kriemann


A new method to construct task graphs for H-matrix arithmetic is introduced, which uses the information associated with all tasks of the standard recursive H-matrix algorithms, e.g., the block index set of the matrix blocks involved in the computation. Task refinement, i.e., the replacement of tasks by sub-computations, is then used to proceed in the H-matrix hierarchy until the matrix blocks containing the actual matrix data are reached. This process is a natural extension of the classical, recursive way in which H-matrix arithmetic is defined and thereby simplifies the efficient usage of many-core systems. Examples for standard and accumulator based H-arithmetic are shown for model problems with different block structures.

Nov 19, 2019
Dec 3, 2019
MSC Codes:
65F05, 65Y05, 65Y20, 68W10, 68W40
hierarchical matrices, task graph, parallel algorithms, many-core processors

Related publications

2022 Repository Open Access
Steffen Börm, Sven Christophersen and Ronald Kriemann

Semi-automatic task graph construction for \(\mathcal{H}\)-matrix arithmetic

In: SIAM journal on scientific computing, 44 (2022) 2, C77-C98