首页> 外文会议>Computer Science and Electronics Engineering (ICCSEE), 2012 International Conference on >Research and Implementation of Jacobi Algorithm Based on MPI with Checkerboard Decomposition
【24h】

Research and Implementation of Jacobi Algorithm Based on MPI with Checkerboard Decomposition

机译:基于MPI棋盘分解的Jacobi算法的研究与实现。

获取原文

摘要

In order to achieve parallel algorithm ported from serial algorithm, this paper proposes a simplified model based on MPI checkerboard decomposition. The process of analysis, design and implementation of parallel program will be speed up, by emphasizing data and calculation decomposition. Jacobi algorithm is used as an example to explain this simplified model. The example results show that simplified model is more suitable for implementation of parallel program than Foster's task/channel model, and checkerboard decomposition has better speedup than row/column decomposition. Furthermore, this simplified model applies to design not only Jacobi algorithm but also other parallel algorithms based on checkerboard decomposition.
机译:为了实现从串行算法移植到并行算法,本文提出了一种基于MPI棋盘格分解的简化模型。通过强调数据和计算分解,将加快并行程序的分析,设计和实现的过程。以Jacobi算法为例来说明此简化模型。实例结果表明,与Foster的任务/通道模型相比,简化模型更适合于并行程序的实现,而棋盘格分解的速度比行/列分解的速度要好。此外,该简化模型不仅适用于设计Jacobi算法,还适用于基于棋盘分解的其他并行算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号