【24h】

Parallel Smoother Based on Block Red-Black Ordering for Multigrid Poisson Solver

机译:基于块红黑色订购的平行更畅通,为Multigrid Poisson Solver

获取原文

摘要

This paper describes parallelization techniques for a multi-grid solver for finite difference analysis of three-dimensional Poisson equations. We first apply our block red-black ordering for parallelization of a Gauss-Seidel (GS) smoother, whose sequentiality is often problematic in parallelization of multigrid methods. Furthermore, we introduce a new multiplicative Schwarz smoother, in which multiple GS iterations are performed in each of red-black ordered blocks. Numerical tests are conducted on a cluster of multi-processor nodes comprising four quad-core AMD Opteron processors to examine the effectiveness of these parallel smoothers. The multi-process test using 216 processes in flat-MPI model shows that the block red-black GS smoother and its multiplicative Schwarz variant achieve 1.3 and 1.8 times better performance than the conventional red-black GS smoother, respectively.
机译:本文介绍了用于多网格求解器的平行化技术,用于三维泊松方程的有限差分分析。我们首先应用我们的块红黑色排序,以进行高斯 - Seidel(GS)更顺畅的并行化,其顺序在多重资源型方法的并行化方面经常有问题。此外,我们介绍了一种新的乘法施瓦茨更顺畅,其中在红黑色有序块中执行多个GS迭代。数值测试在包括四个四核AMD Opteron处理器的多处理器节点集群上进行,以检查这些平行的SmoOthers的有效性。使用平面MPI模型中的216进程的多过程测试表明,块红黑色GS光滑,其乘法施瓦茨变体分别比传统的红黑GS更顺畅,达到1.3倍和1.8倍。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号