【24h】

Block Size Selection of Parallel LU Factorization

机译:并行LU分解的块大小选择

获取原文

摘要

In this paper, we proposed a unified framework and try to address the optimal block size selection problem for paral-lel blocked LU factorization based on ScaLAPACK package since it uses block cyclic data distribution fashion, block size plays important role in determining the final perfor-mance. Through the analysis with our proposed framework and experiments on small scale system configuration, we found that among all these factors, load balance and lo-cal block size selection play key roles in determining the optimal block size on SR2201(pseudo-vector based MPP machine). The optimal block size is determined by the pro-cessor grid shape and problem size. Bssed on this observa-tion, an optimal block size prediction formula with proces-sor grid shape and problem size as parameters was given that can match with the experimental results well. The ap-plication of our framework on scalar based parallel ma-chines and on other applications program wound be the fu-ture work.
机译:在本文中,我们提出了一个统一的框架,并尝试解决基于ScaLAPACK包的paral-lel块LU分解的最佳块大小选择问题,因为它使用块循环数据分发方式,块大小在确定最终性能方面起着重要作用。 ce通过我们提出的框架分析和对小规模系统配置的实验,我们发现,在所有这些因素中,负载平衡和本地块大小选择在确定SR2201(基于伪矢量的MPP机器)上的最佳块大小方面起着关键作用。 )。最佳块大小由处理器的网格形状和问题大小确定。在此基础上,给出了以过程网格形状和问题大小为参数的最优块大小预测公式,该公式与实验结果吻合较好。我们的框架在基于标量的并行机和其他应用程序上的应用是未来的工作。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号