首页> 外文期刊>Computers & mathematics with applications >Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
【24h】

Minimizing synchronizations in sparse iterative solvers for distributed supercomputers

机译:最小化分布式超级计算机的稀疏迭代求解器中的同步

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

摘要

Eliminating synchronizations is one of the important techniques related to minimizing communications for modern high performance computing. This paper discusses principles of reducing communications due to global synchronizations in sparse iterative solvers on distributed supercomputers. We demonstrate how to minimize global synchronizations by rescheduling a typical Krylov subspace method. The benefit of minimizing synchronizations is shown in theoretical analysis and verified by numerical experiments. The experiments also show the local communications for some structured sparse matrix-vector multiplications and global communications in the underlying supercomputers increase in the order P~(1/2.5) and P~(4/5)respectively. Where P is the number of Drocessors.
机译:消除同步是与最小化现代高性能计算通信相关的重要技术之一。本文讨论了在分布式超级计算机上的稀疏迭代求解器中,由于全局同步而减少通信的原理。我们演示了如何通过重新安排典型的Krylov子空间方法来最小化全局同步。理论分析显示了最小化同步的好处,并通过数值实验进行了验证。实验还表明,某些结构化稀疏矩阵矢量乘法的本地通信和底层超级计算机中的全局通信分别以P〜(1 / 2.5)和P〜(4/5)的顺序增加。其中P是Drocessor的数量。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号