首页> 外文学位 >Parallel computing of overset grids for aerodynamic problems with moving objects.
【24h】

Parallel computing of overset grids for aerodynamic problems with moving objects.

机译:重叠栅格的并行计算可解决运动物体的空气动力学问题。

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

摘要

When a store is dropped from a military aircraft at high subsonic, transonic, or supersonic speeds, the aerodynamic forces and moments acting on the store can be sufficient to send the store back into contact with the aircraft. Therefore, store separation analysis is used to certify the safety of any proposed drop. Time accurate computational fluid dynamics (CFD) offers the option of calculating store separation trajectories from first principles.; In the Chimera grid scheme, a set of independent, overlapping, structured grids are used to decompose the domain of interest. This allows the use of efficient structured grid flow solvers and associated boundary conditions, and allows for grid motion without stretching or regridding. However, these advantages are gained in exchange for the requirement to establish communication links between the overlapping grids via a process referred to as “grid assembly.”; Relatively little work has been done to use parallel computing for time accurate, moving body problems. Thus, new techniques are presented for the parallel implementation of the assembly of overset, Chimera grids.; This work is based on the grid assembly function defined in the Beggar code, currently under development at Eglin Air Force Base, FL.; The parallel performance of each implementation is analyzed and equations are presented for estimating the parallel speedup. Each successive implementation attacks the weaknesses of the previous implementation in an effort to improve the parallel performance.; The first implementation achieves the solution of moving body problems on multiple processors with minimum code changes. The second implementation improves the parallel performance by hiding the execution time of the grid assembly function behind the execution time of the flow solver. The third implementation uses coarse grain data decomposition to reduce the execution time of the grid assembly function. The final implementation demonstrates the fine grain decomposition of the grid assembly through the fine grain decomposition of the hole cutting process. Shared memory techniques are used in the final implementation and appropriate dynamic load balancing algorithms are presented. (Abstract shortened by UMI.)
机译:当商店以高次音速,跨音速或超音速的速度从军用飞机上跌落时,作用在商店上的空气动力和力矩足以使商店重新与飞机接触。因此,商店分离分析用于证明任何建议的滴剂的安全性。时间精确的计算流体动力学(CFD)提供了根据第一原理计算存储分离轨迹的选项。在Chimera网格方案中,一组独立的,重叠的,结构化的网格用于分解感兴趣的区域。这允许使用有效的结构化网格流解算器和相关的边界条件,并允许网格运动而不会拉伸或重新网格化。然而,通过交换被称为“网格组装”的过程在重叠的网格之间建立通信链接的要求,获得了这些优点。使用并行计算来解决时间精确的运动物体问题相对较少。因此,提出了新技术,用于平行实施重叠的Chimera网格的装配。这项工作基于Beggar代码中定义的网格装配功能,目前正在佛罗里达州的Eglin空军基地开发。分析了每种实现的并行性能,并给出了用于估计并行加速的方程。每个连续的实现都会攻击先前实现的弱点,以提高并行性能。第一个实现方案以最少的代码更改实现了在多个处理器上移动物体问题的解决方案。第二种实现方式是通过将网格装配函数的执行时间隐藏在流求解器的执行时间之后来提高并行性能。第三种实现使用粗粒度数据分解来减少网格装配功能的执行时间。最终实现通过孔切割过程的细颗粒分解演示了栅格组件的细颗粒分解。最终实现中使用了共享内存技术,并提出了适当的动态负载平衡算法。 (摘要由UMI缩短。)

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号