Temat: NVIDIA CUDA GPU - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Grammar based multi-frontal solver for isogeometric analysis in 1d
Autorzy:: Kuźnik, K.
Paszyński, M
Calo, V.
Powiązania:: https://bibliotekanauki.pl/articles/305531.pdf
Data publikacji:: 2013
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: graph grammar
direct solver
isogeometric finite element method
NVIDIA CUDA GPU
Opis:: In this paper, we present a multi-frontal direct solver for one-dimensional iso-geometric finite element method. The solver implementation is based on the graph grammar (GG) model. The GG model allows us to express the entire solver algorithm, including generation of frontal matrices, merging, and eliminations as a set of basic undividable tasks called graph grammar productions. Having the solver algorithm expressed as GG productions, we can find the partial order of execution and create a dependency graph, allowing for scheduling of tasks into shared memory parallel machine. We focus on the implementation of the solver with NVIDIA CUDA on the graphic processing unit (GPU). The solver has been tested for linear, quadratic, cubic, and higher-order B-splines, resulting in logarithmic scalability.
Źródło:: Computer Science; 2013, 14 (4); 589-613
1508-2806
2300-7036
Pojawia się w:: Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Hypergrammar-based parallel multi-frontal solver for grids with point singularities
Autorzy:: Gurgul, P.
Paszyński, M.
Paszyńska, A.
Powiązania:: https://bibliotekanauki.pl/articles/305343.pdf
Data publikacji:: 2015
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: hypergraph grammar
direct solver
h-adaptive finite element method
NVIDIA CUDA GPU
Opis:: 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.
Źródło:: Computer Science; 2015, 16 (1); 75-102
1508-2806
2300-7036
Pojawia się w:: Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Stereoscopic video chroma key processing using NVIDIA CUDA
Autorzy:: Sagan, J.
Powiązania:: https://bibliotekanauki.pl/articles/106272.pdf
Data publikacji:: 2013
Wydawca:: Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:: NVIDIA CUDA
chroma key processing
GPU
CPU
stereoscopic images
Opis:: In this paper, I use the NVIDIA CUDA technology to perform the chroma key algorithm on stereoscopic images. NVIDIA CUDA allows to process parallel algorithms on GPU. Input data are stereoscopic images with the monochromatic background and the destination background image. Output data is the combination of inputs by using the chroma key. I compare the algorithm efficiency between the GPU and CPU execution.
Źródło:: Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2013, 13, 1; 81-87
1732-1360
2083-3628
Pojawia się w:: Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja