Numerical methods and programming
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Num. Meth. Prog.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Num. Meth. Prog., 2009, Volume 10, Issue 1, Pages 123–131 (Mi vmp363)  

Вычислительные методы и приложения

TIM-2D fine-grain paralleling algorithms

A. A. Voropinov

Federal State Unitary Enterprise "Russian Federal Nuclear Center — All-Russian Research Institute of Experimental Physics", Sarov, Nizhny Novgorod region

Abstract: 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.

Full text: PDF file (859 kB)
UDC: 519.6

Citation: A. A. Voropinov, “TIM-2D fine-grain paralleling algorithms”, Num. Meth. Prog., 10:1 (2009), 123–131

Citation in format AMSBIB
\Bibitem{Vor09}
\by A.~A.~Voropinov
\paper TIM-2D fine-grain paralleling algorithms
\jour Num. Meth. Prog.
\yr 2009
\vol 10
\issue 1
\pages 123--131
\mathnet{http://mi.mathnet.ru/vmp363}


Linking options:
  • http://mi.mathnet.ru/eng/vmp363
  • http://mi.mathnet.ru/eng/vmp/v10/i1/p123

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Numerical methods and programming
    Number of views:
    This page:40
    Full text:14

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2022