首页> 外文期刊>Parallel Computing >Performance analysis of explicit group parallel algorithms for distributed memory multicomputer
【24h】

Performance analysis of explicit group parallel algorithms for distributed memory multicomputer

机译:分布式内存多计算机显式组并行算法的性能分析

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

摘要

Since their introduction, the four-point explicit group (EG) and explicit decoupled group (EDG) methods in solving elliptic PDE's have been implemented on various parallel computing architectures such as shared memory parallel computer and distributed computer systems. However, no detailed study on the performance analysis of these algorithms was done in any of these implementations. In this paper we developed performance models for these explicit group methods and present detailed study of their hypothetical implementation on two distributed memory multicomputers with different computation speed and communication bandwidth. Detailed performance analysis based on these models predicted different theoretical performance if the methods were implemented on the clusters. This was confirmed by the experimental results performed on the two distinct clusters. Theoretical analysis and experimental results indicated that both explicit group methods are scalable with respect to number of processors and the problem size.
机译:自从引入以来,解决椭圆PDE的四点显式组(EG)和显式解耦组(EDG)方法已在各种并行计算体系结构上实现,例如共享内存并行计算机和分布式计算机系统。但是,在任何这些实现​​中都没有对这些算法的性能分析进行详细研究。在本文中,我们为这些显式组方法开发了性能模型,并对其在两个计算速度和通信带宽不同的分布式内存多计算机上的假设实现进行了详细研究。如果在集群上实施这些方法,则基于这些模型的详细性能分析将预测不同的理论性能。在两个不同的群集上执行的实验结果证实了这一点。理论分析和实验结果表明,这两种显式分组方法在处理器数量和问题大小方面都是可扩展的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号