Geodesic
TIM-2D fine-grain paralleling algorithms
Numerical methods and programming, Tome 10 (2009) no. 1, pp. 123-131.

Voir la notice de l'article provenant de la source Math-Net.Ru

TIM-2D is a continuum mechanics code that uses irregular polygonal grids of an arbitrary structure. TIM-3D is paralleled at three levels. At the upper level, the simulation is paralleled in domains within the distributed memory model using MPI. At the second level, the simulation is paralleled in para-domains (the domain is broken down to fragments with cell arrangement into one layer), also using MPI. At the third (bottom) level, iterations of simulation cycles are paralleled within the distributed memory model using the OpenMP interface. These approaches can be used together in different combinations, or separately in a single simulation. The paper discusses fine-grain paralleling algorithms (the second level) and their interfacing with the domain decomposition and the OpenMP-based paralleling. The parallel efficiency is measured on the basis of a number of test simulations. The paper was prepared on the basis of the author's report at the International Conference on Parallel Computing Technologies (PaVT-2009; http://agora.guru.ru/pavt2009).
Keywords: TIM approach; distributed memory model; paralleling; MPI interface; irregular grids. 
@article{VMP_2009_10_1_a14,
     author = {A. A. Voropinov},
     title = {TIM-2D fine-grain paralleling algorithms},
     journal = {Numerical methods and programming},
     pages = {123--131},
     publisher = {mathdoc},
     volume = {10},
     number = {1},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMP_2009_10_1_a14/}
}
TY  - JOUR
AU  - A. A. Voropinov
TI  - TIM-2D fine-grain paralleling algorithms
JO  - Numerical methods and programming
PY  - 2009
SP  - 123
EP  - 131
VL  - 10
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMP_2009_10_1_a14/
LA  - ru
ID  - VMP_2009_10_1_a14
ER  - 
%0 Journal Article
%A A. A. Voropinov
%T TIM-2D fine-grain paralleling algorithms
%J Numerical methods and programming
%D 2009
%P 123-131
%V 10
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMP_2009_10_1_a14/
%G ru
%F VMP_2009_10_1_a14
A. A. Voropinov. TIM-2D fine-grain paralleling algorithms. Numerical methods and programming, Tome 10 (2009) no. 1, pp. 123-131. http://geodesic.mathdoc.fr/item/VMP_2009_10_1_a14/