Graph grammar based multi-frontal multi-thread direct solver in GALOIS

Seminar:

Graph grammar based multi-frontal multi-thread direct solver in GALOIS
Thursday, August 28, 2014
3:30PM – 5PM
POB 6.304

Maciej Paszynski

This talk presents a multi-frontal solver algorithm for the adaptive finite element method expressed by graph grammar productions and executed in GALOIS. The graph grammar productions construct first the binary elimination tree, and then process frontal matrices stored in distributed manner in nodes of the elimination tree. The solver is specialized for a class of one, two and three dimensional h refined meshes whose elimination tree has a regular structure. In particular, this class contains all one dimensional grids, two and three dimensional grids refined towards point singularities, two dimensional grids refined in an anisotropic way towards edge singularity as well as three dimensional grids refined in an anisotropic way towards edge or face singularities. In all these cases, the structure of the elimination tree and the structure of the frontal matrices are similar. The solver is implemented within the GALOIS environment, which allows parallel execution of graph grammar productions. We also compare the performance of the GALOIS implementation of our graph grammar based solver with the sequential and parallel MUMPS solver. We show that our multi-thread GALOIS solver outperforms the sequential and parallel MUMPS solver.

Collaborators:
Keshav Pingali (ICES)
Andrew Lenharth (ICES)
Donald Nguyen (ICES)
Konrad Jopek (AGH)
Damian Goik (AGH)
Maciej Wozniak (AGH)

Hosted by Keshav Pingali