Implementation of algorithms with a fine-grained parallelism on GPUs
Institute of Computational Mathematics and Mathematical Geophysics (Computing Center), Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Numerical Analysis and Applications, Vol. 4, No. 1. (1 January 2011), pp. 46-55.
@article{springerlink:10.1134/S1995423911010058,
author={Kalgin, K.},
affiliation={Institute of Computational Mathematics and Mathematical Geophysics, Siberian Branch, Russian Academy of Sciences, pr. Akad. Lavrent’eva 6, Novosibirsk, 630090 Russia},
title={Implementation of algorithms with a fine-grained parallelism on GPUs},
journal={Numerical Analysis and Applications},
publisher={MAIK Nauka/Interperiodica distributed exclusively by Springer Science+Business Media LLC.},
issn={1995-4239},
keyword={Mathematics},
pages={46-55},
volume={4},
issue={1},
url={http://dx.doi.org/10.1134/S1995423911010058},
note={10.1134/S1995423911010058},
year={2011}
}
The efficiency of implementations of algorithms with a fine-grained parallelism on GPUs that support the CUDA architecture is studied. Cellular automata and difference schemes are used for testing. Several versions of implementations are proposed and their efficiency is analyzed. An example of GPU application for modeling the process of carbon dioxide oxidation on the catalyst surface is given.
March 17, 2011 by hgpu
Your response
You must be logged in to post a comment.
