当前位置: X-MOL 学术J. Parallel Distrib. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Structured multi-block grid partitioning using balanced cut trees
Journal of Parallel and Distributed Computing ( IF 3.8 ) Pub Date : 2019-12-27 , DOI: 10.1016/j.jpdc.2019.12.010
Georg Geiser , Wolfgang Schröder

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.



中文翻译:

使用平衡割树的结构化多块网格划分

提出了一种对结构化的多块六面体网格进行分区的算法,以将分区分配给给定数量的箱,实现负载均衡分配。它使用平衡的分层剪切树数据结构将结构化的块划分为结构化的分区。砍伐树木的细化尝试生成具有少量附加曲面的形状相同的分区。提出了一种多块负载均衡方法,该方法保证满足负载不均衡的上限。将算法的分区质量与已建立的递归边缘对分方法和使用METIS的非结构化分区进行比较。在生成负载平衡的结构化分区时,两个通用和两个涡轮机械测试案例证明了本算法的卓越质量和快速运行时间。

更新日期:2020-01-04
down
wechat
bug