首页> 外文会议>Parallel and Distributed Computing and Networks >A PARALLEL AND SCALABLE ALGORITHM FOR CALCULATING LINEAR AND NON-LINEAR RECURRENCE EQUATIONS
【24h】

A PARALLEL AND SCALABLE ALGORITHM FOR CALCULATING LINEAR AND NON-LINEAR RECURRENCE EQUATIONS

机译:计算线性和非线性递推方程的并行和可缩放算法

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

摘要

A tridiagonal linear system of equations for ADI can be solved by "Gaussian elimination" which consists of calculating two types of recurrence equations, both of which need to be carefully parallelized in order to achieve high performance. We propose a parallel and scalable scheme for calculating these recurrence equations and our experiment shows that it provides an exact solution with good accuracy and achieves P/2.1 speedup without any startup delay required for the cell-partitioned methods. Our scheme is suitable for PC cluster system since the communication overhead can be ignored when the size of the dimension of arrays to be distributed is sufficiently large.
机译:ADI的三对角线性方程组可以通过“高斯消除”来解决,该算法包括计算两种类型的递归方程,为了实现高性能,都需要对其进行仔细并行处理。我们提出了一种并行且可扩展的方案来计算这些递归方程,并且我们的实验表明,它提供了具有良好准确性的精确解决方案,并实现了P / 2.1加速,而没有单元划分方法所需的任何启动延迟。我们的方案适用于PC群集系统,因为当要分布的阵列尺寸足够大时,可以忽略通信开销。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号