Skip to Main content Skip to Navigation
Reports

A hierarchical fast direct solver for distributed memory machines with manycore nodes

Abstract : Compression techniques have revolutionized the Boundary Element Method used to solve the Maxwell equations in frequency domain. In spite of the several orders of magnitude gained in terms of computational cost, and resource consumption, their implementation in a direct solver remains challenging, especially on distributed memory machines. We present the design of an efficient and scalable hierarchical fast direct solver capable of factorizing H-matrices on large scale machines with manycore nodes. This task-based solver relies on a flexible execution model which features an extension of the sequential task flow (STF) paradigm, enabling seamless expression of complex dependencies between hierarchical data over distributed memory machines. We demonstrate its efficiency and its scalability by solving large scale problems over hundred of manycore nodes, and for example factorize a H-matrix with 4.4 million unknowns compressed at 99% in less than 40 minutes with about 70% of parallel efficiency over 24,320 cores.
Complete list of metadatas

Cited literature [43 references]  Display  Hide  Download

https://hal-cea.archives-ouvertes.fr/cea-02304706
Contributor : Cedric Augonnet <>
Submitted on : Thursday, October 3, 2019 - 2:34:06 PM
Last modification on : Wednesday, December 11, 2019 - 1:54:05 PM

File

HMAT-CEA-RR.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : cea-02304706, version 1

Collections

CEA | DAM | LARA

Citation

Cédric Augonnet, David Goudin, Matthieu Kuhn, Xavier Lacoste, Raymond Namyst, et al.. A hierarchical fast direct solver for distributed memory machines with manycore nodes. [Research Report] CEA/DAM; Total E&P; Université de Bordeaux. 2019. ⟨cea-02304706⟩

Share

Metrics

Record views

379

Files downloads

285