Structured multi-block grid partitioning using balanced cut trees
| Autor: | Geiser, Georg, Schröder, Wolfgang |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Computer Networks and Communications
Computer science 020206 networking & telecommunications 02 engineering and technology Grid partitioning Structured multi-block grids Load balancing Parallel computing Load balancing (computing) Grid Partition (database) Upper and lower bounds Theoretical Computer Science Tree (data structure) Artificial Intelligence Hardware and Architecture 0202 electrical engineering electronic engineering information engineering Partition (number theory) 020201 artificial intelligence & image processing Hexahedron Algorithm Software |
| Zdroj: | Journal of Parallel and Distributed Computing. 138:139-152 |
| ISSN: | 0743-7315 |
| DOI: | 10.1016/j.jpdc.2019.12.010 |
| Popis: | An algorithm to partition structured multi-block hexahedral grids for a load balanced assignment of the partitions to a given number of bins is presented. It uses a balanced hierarchical cut tree data structure to partition the structured blocks into structured partitions. The refinement of the cut tree attempts to generate equally shaped partitions with a low amount of additional surface. A multi-block load balancing approach is presented that guarantees to satisfy an upper bound of load imbalance. The partition quality of the algorithm is compared to established recursive edge bisection approaches and an unstructured partitioning using METIS. Two generic and two turbomachinery test cases demonstrate the superior quality and fast runtime of the present algorithm at generating load balanced structured partitions. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect