首页> 外文期刊>Journal of Computational Physics >SCALABILITY AND PERFORMANCE OF DATA-PARALLEL PRESSURE-BASED MULTIGRID METHODS FOR VISCOUS FLOWS
【24h】

SCALABILITY AND PERFORMANCE OF DATA-PARALLEL PRESSURE-BASED MULTIGRID METHODS FOR VISCOUS FLOWS

机译:基于数据并行压力的粘性流多重网格方法的可扩展性和性能

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

摘要

A full-approximation storage multigrid method for solving the steady-state 2-d incompressible Navier-Stokes equations on staggered grids has been implemented in Fortran on the CM-5, using the array aliasing feature in CM-Fortran to avoid declaring fine-grid-sized arrays on all levels while still allowing a variable number of grid levels. Thus, the storage cost scales with the number of unknowns,allowing us to consider significantly larger problems than would otherwise be possible. Timings over a range of problem sizes and numbers of processors, up to 4096 x 4096 on 512 nodes, show that the smoothing procedure, a pressure-correction technique, is scalable and that the restriction and prolongation steps are nearly so. The performance obtained for the multigrid method is 333 Mflops out of the theoretical peak 4 Gflops on a 32-node CM-5. In comparison, a single-grid computation obtained 420 Mflops. The decrease is due to the inefficiency of the smoothing iterations on the coarse grid levels. W cycles cost much more and are much less efficient than V cycles, due to the increased contribution from the coarse grids. The convergence rate characteristics of the pressure-correction multigrid method are investigated in a Re = 5000 lid-driven cavity flow and a Re = 300 symmetric backward-facing step flow, using either a defect-correction scheme or a second-order upwind scheme. A heuristic technique relating the convergence tolerances for the coarse grids to the truncation error of the discretization has been found effective and robust. With second-order upwinding on all grid levels, a 5-level 320 x 80 step flow solution was obtained in 20 V cycles, which corresponds to a smoothing rate of 0.7, and required 25 s on a 32-node CM-5. Overall, the convergence rates obtained in the present work are comparable to the most competitive findings reported in the literature. (C) 1996 Academic Press, Inc. [References: 62]
机译:使用CM-Fortran中的数组别名功能以避免声明精细网格,在CM-5上的Fortran中实现了用于解决交错网格上的稳态2d不可压缩Navier-Stokes方程的全近似存储多网格方法。大小的数组在所有级别上,同时仍允许可变数量的网格级别。因此,存储成本随未知数而定,这使我们能够考虑比原本可能的大得多的问题。一系列问题的大小和处理器数量(在512个节点上的最大分辨率为4096 x 4096)上的时间表明,平滑过程(一种压力校正技术)是可伸缩的,并且限制和延长步骤几乎是可伸缩的。在32节点CM-5上,多网格方法获得的性能为理论峰值4 Gflops的333 Mflops。相比之下,单网格计算获得了420 Mflops。减少是由于粗糙网格级别上的平滑迭代效率低下。由于粗网格的增加,W循环的成本比V循环高得多,而效率却低得多。使用缺陷校正方案或二阶迎风方案,在Re = 5000盖驱动腔流和Re = 300对称向后步进流中研究了压力校正多网格方法的收敛速率特征。已经发现将粗网格的收敛容限与离散化的截断误差相关联的启发式技术是有效且鲁棒的。通过在所有网格级别上进行二阶上风,在20 V周期中获得了5级320 x 80阶跃流解,这对应于0.7的平滑率,并且在32节点CM-5上需要25 s。总体而言,在当前工作中获得的收敛速度与文献中报道的最具竞争力的发现相当。 (C)1996 Academic Press,Inc. [参考:62]

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号