RUS  ENG
Full version
JOURNALS // Sibirskii Zhurnal Vychislitel'noi Matematiki // Archive

Sib. Zh. Vychisl. Mat., 2011 Volume 14, Number 1, Pages 59–70 (Mi sjvm426)

This article is cited in 11 papers

Implementation of algorithms with a fine-grained parallelism on GPUs

K. V. Kalgin

Institute of Computational Mathematics and Mathematical Geophysics (Computing Center), Siberian Branch of the Russian Academy of Sciences, Novosibirsk

Abstract: The efficiency of implementations of algorithms with a fine-grained parallelism on GPUs that support the CUDA architecture is studied. For testing, cellular automata and differential schemes are used. We offer several versions of implementations and analyze their productivity. An example of the GPU application for modeling the process of carbon dioxide oxidation on the catalyst surface is given.

Key words: graphical processing unit, GPGPU, CUDA, cellular automata, fine-grained algorithms, parallel implementation.

UDC: 621.391.1+004.7

Received: 27.01.2010
Revised: 09.04.2010


 English version:
Numerical Analysis and Applications, 2011, 4:1, 46–55

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024