首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一类多线程并行四面体网格优化算法
引用本文:尚萌萌,郑耀,陈建军,朱朝艳.一类多线程并行四面体网格优化算法[J].计算力学学报,2016,33(4):613-620.
作者姓名:尚萌萌  郑耀  陈建军  朱朝艳
作者单位:1. 浙江大学 工程与科学计算研究中心,浙江大学 航空航天学院,杭州 310027;2. 浙江大学 工程与科学计算研究中心,浙江大学 航空航天学院,杭州 310027; 浙江大学 宁波理工学院,宁波 315100
基金项目:国家自然科学基金(11432013,11172267);浙江省自然科学基金(LR16F020002)资助项目.
摘    要:提出了一类多线程并行、组合了光滑化与局部重连操作的四面体网格优化算法。采用传统的基于拓扑的数据分解策略实现了并行光滑化算法,利用图染色算法将待光滑化的点分解成多个独立点集。同时提出将一类基于几何的数据分解策略应用于局部重连操作的并行化,在每个局部重连操作涉及的几何区域中定义一个特征点,然后沿希尔伯特(Hilbert)曲线对特征点进行排序,曲线的均匀分解对应局部重连操作在各线程的分配。这一分配策略的优点是使并行执行局部重连操作时重连区域相互干涉的情形极少出现。因此,当干涉情形出现时,可选择放弃产生干涉的操作,并行优化效率和效果并无明显的负面影响。最后,数值实验验证了本文算法的效率和有效性。

关 键 词:网格生成  质量优化  非结构网格  并行算法  多线程
收稿时间:2016/5/19 0:00:00
修稿时间:2016/6/20 0:00:00

A multi-threaded parallel algorithm for quality improvement of tetrahedral meshes
SHANG Meng-meng,ZHENG Yao,CHEN Jian-jun and ZHU Chao-yan.A multi-threaded parallel algorithm for quality improvement of tetrahedral meshes[J].Chinese Journal of Computational Mechanics,2016,33(4):613-620.
Authors:SHANG Meng-meng  ZHENG Yao  CHEN Jian-jun and ZHU Chao-yan
Institution:Center for Engineering and Scientific Computation, School of Aeronautics and Astronautics, Zhejiang University, Hangzhou 310027, China;Center for Engineering and Scientific Computation, School of Aeronautics and Astronautics, Zhejiang University, Hangzhou 310027, China;Center for Engineering and Scientific Computation, School of Aeronautics and Astronautics, Zhejiang University, Hangzhou 310027, China;Center for Engineering and Scientific Computation, School of Aeronautics and Astronautics, Zhejiang University, Hangzhou 310027, China;Ningbo Institute of Technology, Zhejiang University, Ningbo 315100, China
Abstract:A multi-threaded parallel version of a sequential quality improvement algorithm for tetrahedral meshes is proposed.The sequential algorithm combines mesh smoothing operations and local reconnection operations;thus,different techniques are developed to parallelize both operations.The parallelization of mesh smoothing operations is based on an existing data decomposition technique,which colors the dual graph of the mesh to subdivide mesh points into a few independent sets.The parallelization of local reconnection operation is based on a new data decomposition technique,which defines a feature point in the interior of each local reconnection operation,and sorts the features points along a Hilbert curve.The decomposition of this Hilbert curve in order could result in a required distribution of local reconnection operations on active threads.This distribution features its ability to ensure that the regions of local operations concurrently executed in different threads are usually separated far away,so that the possibility of interference is reduced to a very low level.As a result,even if interference happens,we could simply withdraw those local reconnection operations that cause interference,and it was observed that no obvious negative impact was introduced by this simple strategy.Finally,numerical experiments are presented to verify the effectiveness and efficiency of the proposed algorithm.
Keywords:mesh generation  quality improvement  unstructured mesh  parallel algorithm  multi-threaded
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算力学学报》浏览原始摘要信息
点击此处可从《计算力学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号