首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >A new algorithm based on Givens rotations for solving linear equations on fault-tolerant mesh-connected processors
【24h】

A new algorithm based on Givens rotations for solving linear equations on fault-tolerant mesh-connected processors

机译:基于Givens旋转的新算法在容错网格连接处理器上求解线性方程组

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

摘要

In this paper, we propose a new I/O overhead free Givens rotations based parallel algorithm for solving a system of linear equations. The algorithm uses a new technique called two-sided elimination and requires an N/spl times/(N+1) mesh-connected processor array to solve N linear equations in (5N-log N-4) time steps. The array is well suited for VLSI implementation as identical processors with simple and regular interconnection pattern are required. We also describe a fault-tolerant scheme based on an algorithm based fault tolerance (ABFT) approach. This scheme has small hardware and time overhead and can tolerate up to N processor failures.
机译:在本文中,我们提出了一种新的基于I / O开销的无给定Givens旋转的并行算法,用于求解线性方程组。该算法使用一种称为双面消除的新技术,并且需要一个N / spl次/(N + 1)个网格连接的处理器阵列才能以(5N-log N-4)个时间步长求解N个线性方程。该阵列非常适合VLSI实现,因为需要具有简单且规则互连模式的相同处理器。我们还描述了一种基于基于算法的容错(ABFT)方法的容错方案。该方案具有较小的硬件和时间开销,并且可以承受多达N个处理器故障。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号