Graph grammar-based multi-thread multi-frontal parallel solver with trace theory-based scheduler | Zendy

Paweł Obrok | Zendy; P. Pierzchała | Zendy; Arkadiusz Szymczak | Zendy; Maciej Paszyński | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Graph grammar-based multi-thread multi-frontal parallel solver with trace theory-based scheduler

Author(s) -

Paweł Obrok,

P. Pierzchała,

Arkadiusz Szymczak,

Maciej Paszyński

Publication year - 2010

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2010.04.223

Subject(s) - computer science , solver , parallel computing , thread (computing) , cuda , graph , grammar , algorithm , programming language , theoretical computer science , linguistics , philosophy

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research