Szczegóły publikacji
Opis bibliograficzny
Hypergrammar-based parallel multi-frontal solver for grids with point singularities / Piotr GURGUL, Maciej PASZYŃSKI, Anna Paszyńska // Computer Science ; ISSN 1508-2806. — 2015 — vol. 16 no. 1, s. 75–102. — Bibliogr. s. 99–101, Abstr.
Autorzy (3)
- AGHGurgul Piotr
- AGHPaszyński Maciej
- Paszyńska Anna
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 92134 |
|---|---|
| Data dodania do BaDAP | 2015-10-01 |
| Tekst źródłowy | URL |
| DOI | 10.7494/csci.2015.16.1.75 |
| Rok publikacji | 2015 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Computer Science |
Abstract
This paper describes the application of hypergraph grammars to drive a linear computational cost solver for grids with point singularities. Such graph grammar productions are the first mathematical formalisms used to describe solver algorithms, and each indicates the smallest atomic task that can be executed in parallel, which is very useful in the case of parallel execution. In particular,the partial order of execution of graph grammar productions can be found, and the sets of independent graph grammar productions can be localized. They can be scheduled set by set into a shared memory parallel machine. The graph-grammar-based solver has been implemented with NVIDIA CUDA for GPU. Graph grammar productions are accompanied by numerical results for a 2D case. We show that our graph-grammar-based solver with a GPU accelerator is, by order of magnitude, faster than the state-of-the-art MUMPS solver.
