| Autor: |
Golovchenko, E. N. |
| Zdroj: |
Mathematical Models & Computer Simulations; Dec2022, Vol. 14 Issue 6, p910-917, 8p |
| Abstrakt: |
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 × 106 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. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink