检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国航空计算技术研究所,陕西西安710068
出 处:《航空计算技术》2007年第3期41-43,47,共4页Aeronautical Computing Technique
摘 要:在飞行器阻力数值模拟中常常需要数百万网格点的巨型混合网格,甚至需要网格点数达到数千万的超巨型混合网格。在并行计算前往往需要对这些大规模混合网格进行分区操作。针对M etis库函数所需要输入的大规模边表的生成问题,提出了一种生成边表的并行算法,并运用此算法,在微机机群上对具有4,787,893个网格点的DLR-F6翼型(翼身组合体+挂架+发动机短舱)的巨型混合网格成功地生成21,556,110条边的大规模边表,进而采用M etis提供的多级循环二分法顺利地对该巨型混合网格实现均匀分区,从而验证了该并行算法的有效性。In the numerical simulations of aerocraft's drag, huge hybrid grids with order of million grid points are necessary, and sometimes super hybrid grids whose grid points are more than ten million are required. Before parallel computing, the hybrid grids often need to be partitioned. As for the creation of the huge edgelist that the functions of package Metis need, a parallel algorithm of edgelist's creation is present in this article. Via the algorithm an edgelist of 21,556,110 pieces of edges is created on the cluster from the huge hybrid grid of DLR -F6 (wing-body-pylon-nacelle) that has 4,787,893 nodes, then well-proportioned partition is successfully carried out via the multilevel recursive bisection algorithm package Metis supplies, and the effectiveness of the parallel algorithm is shown.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.227