The Experts below are selected from a list of 1407 Experts worldwide ranked by ideXlab platform
Maciej Paszynski - One of the best experts on this subject based on the ideXlab platform.
-
graph grammar based multi thread multi frontal parallel solver with trace theory based scheduler
International Conference on Conceptual Structures, 2010Co-Authors: Pawel Obrok, Pawel Pierzchala, Arkadiusz Szymczak, Maciej PaszynskiAbstract: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.
-
ICCS - Graph grammar-based multi-thread multi-frontal parallel solver with trace theory-based scheduler
Procedia Computer Science, 2010Co-Authors: Pawel Obrok, Pawel Pierzchala, Arkadiusz Szymczak, Maciej PaszynskiAbstract: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.
Pawel Obrok - One of the best experts on this subject based on the ideXlab platform.
-
graph grammar based multi thread multi frontal parallel solver with trace theory based scheduler
International Conference on Conceptual Structures, 2010Co-Authors: Pawel Obrok, Pawel Pierzchala, Arkadiusz Szymczak, Maciej PaszynskiAbstract: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.
-
ICCS - Graph grammar-based multi-thread multi-frontal parallel solver with trace theory-based scheduler
Procedia Computer Science, 2010Co-Authors: Pawel Obrok, Pawel Pierzchala, Arkadiusz Szymczak, Maciej PaszynskiAbstract: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.
Pawel Pierzchala - One of the best experts on this subject based on the ideXlab platform.
-
graph grammar based multi thread multi frontal parallel solver with trace theory based scheduler
International Conference on Conceptual Structures, 2010Co-Authors: Pawel Obrok, Pawel Pierzchala, Arkadiusz Szymczak, Maciej PaszynskiAbstract: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.
-
ICCS - Graph grammar-based multi-thread multi-frontal parallel solver with trace theory-based scheduler
Procedia Computer Science, 2010Co-Authors: Pawel Obrok, Pawel Pierzchala, Arkadiusz Szymczak, Maciej PaszynskiAbstract: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.
Arkadiusz Szymczak - One of the best experts on this subject based on the ideXlab platform.
-
graph grammar based multi thread multi frontal parallel solver with trace theory based scheduler
International Conference on Conceptual Structures, 2010Co-Authors: Pawel Obrok, Pawel Pierzchala, Arkadiusz Szymczak, Maciej PaszynskiAbstract: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.
-
ICCS - Graph grammar-based multi-thread multi-frontal parallel solver with trace theory-based scheduler
Procedia Computer Science, 2010Co-Authors: Pawel Obrok, Pawel Pierzchala, Arkadiusz Szymczak, Maciej PaszynskiAbstract: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.
Selcuk Sevgen - One of the best experts on this subject based on the ideXlab platform.
-
Detecting and counting people using real-time directional algorithms implemented by compute unified device architecture
Neurocomputing, 2017Co-Authors: Yasemin Poyraz Kocak, Selcuk SevgenAbstract:This paper implements a real-time and directional counting algorithm using the Graphic Processing Unit (GPU) Programming for the purpose of detecting and counting people. We use the Compute Unified Device Architecture (CUDA) as the environment of the GPU programming. The proposed algorithm is implemented for detecting and counting people employing the single virtual line and two virtual lines, respectively, using three video streams and two GPU Graphic Cards GeForce GT 630 and GeForce GTX 550Ti. We first test the video streams on the algorithm by using GeForce GT 630 together with applying the single virtual line and two virtual lines, respectively. Then, we repeat the same procedures for the GPU Graphic Card GeForce GTX 550Ti. The obtained experimental results show that our proposed algorithm running on GPU can be successfully programmed and implemented for people detecting and counting problems.
