首页> 外文期刊>Journal of supercomputing >A scalable parallel algorithm for direct-forcing immersed boundary method for multiphase flow simulation on spectral elements
【24h】

A scalable parallel algorithm for direct-forcing immersed boundary method for multiphase flow simulation on spectral elements

机译:一种可伸缩的并行算法,用于直接迫使沉浸式边界法在光谱元件上的多相流模拟

获取原文
获取原文并翻译 | 示例
           

摘要

In this work, we propose a highly scalable parallel double binned ghost particle (DBGP) algorithm for direct-forcing immersed boundary spectral element method for multiphase flow simulations. In particular, the DBGP algorithm is designed to obtain fully distributed data storage and scalable data transfer across hundreds of thousands of processors. The proposed algorithm uses a queen and worker data structure for fully resolved particles to demarcate particle-level and marker-level quantities and communication. In the DBGP algorithm, each particle's centroid is represented by a queen marker and the particle surface is covered with a uniform distribution of surface worker markers. The queen marker contains information on the translational and rotational motion of a particle and integrates the force and torque computed at all the worker markers, while the worker marker implements the fluid-particle interaction. Ghost queen and ghost worker markers are generated for each real queen and real worker marker during computation for particle-level and marker-level communications, respectively. A double Cartesian binning process is introduced that divides the physical domain into a coarse queen-bin and a fine worker-bin structure in three dimensions. The queen-bin and worker-bin sizes are determined by their zone of influence at the particle-level and marker-level communication, respectively. Bin-to-rank maps that relate each queen-bin and worker-bin to all the MPI ranks that they interact with are created. By using the queen/worker marker representation and two-layer bin-to-rank maps, data communication across very large number of MPI ranks is efficiently carried out. A scaling analysis has been conducted, showing excellent performance of the DBGP algorithm for up to 16,384 MPI ranks in both weak and strong scaling studies. The proposed method has been demonstrated to accurately predict sedimentation of particle clouds. The simulated correlation between the mean settling velocity and volume fraction is in good agreement with empirical correlations from previous studies.
机译:在这项工作中,我们提出了一种高度可扩展的平行双箱重影粒子(DBGP)算法,用于直接强制浸没边界光谱元素方法,用于多相流模拟。特别地,DBGP算法旨在获得完全分布的数据存储和跨数十万个处理器的可扩展数据传输。该算法使用女王和工人数据结构进行完全解析的粒子以划分粒子级和标记级数量和通信。在DBGP算法中,每个粒子的质心由女王标记表示,颗粒表面被表面工人标记的均匀分布覆盖。女王标记包含有关颗粒的平移和旋转运动的信息,并整合在所有工人标记处计算的力和扭矩,而工人标记物实施流体颗粒相互作用。在计算粒度和标记级通信的计算期间,为每个真正的女王和真正的工人标记生成鬼王和鬼工人标记。引入了双笛卡尔融合工艺,将物理领域分成粗拳和三维的精细工人 - 箱结构。女王-bin和工人-bin尺寸分别由它们的粒子水平和标记级通信的影响区域决定。垃圾箱到排名地图将每个女王-bin和worker-bin与创建与其交互的所有MPI等级相关联。通过使用女王/工人标记表示和双层垃圾箱到秩图,有效执行跨越大量MPI等级的数据通信。已经进行了缩放分析,显示了DBGP算法的优异性能,可在弱和强大的缩放研究中获得高达16,384MPi等级。已经证明了所提出的方法以准确地预测颗粒云的沉降。平均沉降速度和体积分数之间的模拟相关性与先前研究的经验相关性吻合良好。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号