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., 2015, Volume 16, Issue 4, Pages 507–517 (Mi vmp560)  

This article is cited in 5 scientific papers (total in 5 papers)

Parallel partitioning tool GridSpiderPar for large mesh decomposition

E. N. Golovchenko, M. V. Iakobovski

Keldysh Institute of Applied Mathematics of Russian Academy of Sciences, Moscow

Abstract: The problem of load balancing arises in parallel mesh-based numerical solution of problems of continuum mechanics, energetics, electrodynamics etc. on high-performance computing systems. The number of processors to run a computational problem is often unknown. It makes sense, therefore, to partition a mesh into a great number of microdomains which then are used to create subdomains. Graph partitioning methods implemented in state-of-the-art parallel partitioning tools ParMETIS, Jostle, PT-Scotch and Zoltan are based on multilevel algorithms. That approach has a shortcoming of forming unconnected subdomains. Another shortcoming of present graph partitioning methods is generation of strongly imbalanced partitions. The program package for parallel large mesh decomposition GridSpiderPar was developed. We compared different partitions into microdomains, microdomain graph partitions and partitions into subdomains of several meshes ($10^8$ vertices, $10^9$ elements) obtained by means of the partitioning tool GridSpiderPar and the packages ParMETIS, Zoltan and PT-Scotch. Balance of the partitions, edge-cut and number of unconnected subdomains in different partitions were compared as well as the computational performance of gas-dynamic problem simulations run on different partitions. The obtained results demonstrate advantages of the devised algorithms.

Keywords: parallel programming, graph partitioning, mesh decomposition.

Full text: PDF file (1076 kB)
UDC: 004.021
Received: 02.09.2015

Citation: E. N. Golovchenko, M. V. Iakobovski, “Parallel partitioning tool GridSpiderPar for large mesh decomposition”, Num. Meth. Prog., 16:4 (2015), 507–517

Citation in format AMSBIB
\Bibitem{GolIak15}
\by E.~N.~Golovchenko, M.~V.~Iakobovski
\paper Parallel partitioning tool GridSpiderPar for large mesh decomposition
\jour Num. Meth. Prog.
\yr 2015
\vol 16
\issue 4
\pages 507--517
\mathnet{http://mi.mathnet.ru/vmp560}


Linking options:
  • http://mi.mathnet.ru/eng/vmp560
  • http://mi.mathnet.ru/eng/vmp/v16/i4/p507

    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

    This publication is cited in the following articles:
    1. S. A. Sukov, “Biblioteka preprotsessornoi obrabotki nestrukturirovannykh setok hm4PreprocessorLib”, Preprinty IPM im. M. V. Keldysha, 2016, 108, 20 pp.  mathnet  crossref
    2. S. A. Sukov, “Metod szhatiya topologii gibridnykh setok i biblioteka podprogramm hm4PackLib”, Preprinty IPM im. M. V. Keldysha, 2017, 128, 15 pp.  mathnet  crossref
    3. B. N. Chetverushkin, V. P. Osipov, V. I. Baluta, “Podkhody k modelirovaniyu posledstvii prinyatiya reshenii v usloviyakh protivodeistviya”, Preprinty IPM im. M. V. Keldysha, 2018, 043, 15 pp.  mathnet  crossref  elib
    4. E. N. Golovchenko, “Obzor algoritmov dekompozitsii grafov”, Preprinty IPM im. M. V. Keldysha, 2020, 002, 38 pp.  mathnet  crossref
    5. E. N. Golovchenko, M. V. Yakobovskii, V. A. Balashov, E. B. Savenkov, “Sravnenie algoritmov dekompozitsii oblasti v zadache pryamogo modelirovaniya techeniya zhidkosti v porovom prostranstve obraztsov gornykh porod”, Matem. modelirovanie, 32:4 (2020), 107–115  mathnet  crossref
  • Numerical methods and programming
    Number of views:
    This page:132
    Full text:69

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