Szczegóły publikacji
Opis bibliograficzny
Graph grammar based multi-thread multi-frontal direct solver with Galois scheduler / Damian Goik, Konrad Jopek, Maciej PASZYŃSKI, Andrew Lenharth, Donald Nguyen, Keshav Pingali // Procedia Computer Science [Dokument elektroniczny]. — Czasopismo elektroniczne ; ISSN 1877-0509. — 2014 — vol. 29, s. 960–969. — Bibliogr. s. 968–969, Abstr. — ICCS 2014 : 14th International Conference on Computational Science : 10th–12th June 2014, Cairns, Australia
Autorzy (6)
- AGHGoik Damian
- AGHJopek Konrad
- AGHPaszyński Maciej
- Lenharth Andrew
- Nguyen Donald
- Pingali Keshav
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 82915 |
|---|---|
| Data dodania do BaDAP | 2014-07-31 |
| Tekst źródłowy | URL |
| DOI | 10.1016/j.procs.2014.05.086 |
| Rok publikacji | 2014 |
| Typ publikacji | referat w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Procedia Computer Science |
Abstract
In this paper, we present a multi-frontal solver algorithm for the adaptive finite element method expressed by graph grammar productions. 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 MUMPS solver.
