Dynamic Load Balancing with the Parallel Partitioning Tool GridSpiderPar

Dynamic adaptive meshes are often used in high-performance computing. A mesh is locally refined or derefined in spots of interest or where high gradients of an objective function arise. To balance the load of processors, it is required to periodically repartition it. Dynamic load balancing algorithm...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical models and computer simulations Vol. 14; no. 6; pp. 910 - 917
Main Author: Golovchenko, E. N.
Format: Journal Article
Language:English
Published: Moscow Pleiades Publishing 01.12.2022
Springer Nature B.V
Subjects:
Dynamic loads
Geometric algorithms
Load balancing
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Mesh partitioning
Partitioning
Simulation and Modeling
graph partitioning
mesh partitioning
high-performance computing
ISSN:2070-0482, 2070-0490
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Dynamic adaptive meshes are often used in high-performance computing. A mesh is locally refined or derefined in spots of interest or where high gradients of an objective function arise. To balance the load of processors, it is required to periodically repartition it. Dynamic load balancing algorithms are developed based on the parallel geometric algorithm of mesh partitioning and the parallel incremental algorithm of graph partitioning using the partitioning tool GridSpiderPar. The initial partition of a mesh with a local refinement (6.7 × 10 6 hexahedrons) is compared with the results of repartitioning using the devised algorithms. A comparison of the results shows the advantages of the parallel geometric algorithm on this mesh and the features of using the parallel incremental algorithm.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2070-0482
2070-0490
DOI:10.1134/S2070048222060072