Szczegóły publikacji
Opis bibliograficzny
Graph grammar-based multi-thread multi-frontal parallel solver with trace theory-based scheduler / Paweł Obrok, Paweł Pierzchała, Arkadiusz Szymczak, Maciej PASZYŃSKI // Procedia Computer Science [Dokument elektroniczny]. — Czasopismo elektroniczne ; ISSN 1877-0509 . — 2010 — vol. 1 iss. 1, s. 1987–1995. — Bibliogr. s. 1995, Abstr. — ICCS 2010 : International Conference on Computational Science : [Amsterdam, May 31–June 2, 2010]. — S. l. : Elsevier, cop. 2010
Autorzy (4)
- Obrok Paweł
- Pierzchała Paweł
- AGHSzymczak Arkadiusz
- AGHPaszyński Maciej
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 52780 |
|---|---|
| Data dodania do BaDAP | 2010-08-16 |
| Tekst źródłowy | URL |
| DOI | 10.1016/j.procs.2010.04.223 |
| Rok publikacji | 2010 |
| Typ publikacji | referat w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Procedia Computer Science |
Abstract
The paper presents the graph grammar based multi-thread multi-frontal parallel direct solver for one and two dimensional Finite Difference Method (FDM). The multi-frontal solver algorithm has been expressed by graph grammar productions. Each production represents an atomic task that internally must be executed in serial. The sequence of graph grammar productions modeling the execution of the solver has been associated with the alphabet for the trace theory analysis. The dependency relation between tasks has been introduced based on the analysis of the solver algorithm. The sequence of productions has been transformed into the Foata Normal Form (FNF). The parallel solver algorithm has been implemented and tested on NVIDIA Cuda multi-core graphic card. The tasks have been scheduled according to the classes in the FNF.
