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

Author

Murthy, K. N Balasubramanya ; Bhuvaneswari, K. ; Ram Murthy, C.S.

Author_Institution

Dept. of Electr. & Electron. Eng., Malnad Coll. of Eng., Hassan, India

Volume

9

Issue

8

fYear

1998

fDate

8/1/1998 12:00:00 AM

Firstpage

825

Lastpage

832

Abstract

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×(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

Keywords

fault tolerant computing; linear algebra; multiprocessor interconnection networks; parallel algorithms; algorithm based fault tolerance; fault-tolerant; fault-tolerant scheme; linear equations; mesh-connected processors; parallel algorithm; Equations; Fault tolerance; Fault tolerant systems; Hardware; Linear systems; Neural networks; Parallel algorithms; Phased arrays; Systolic arrays; Very large scale integration;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.706053

Filename

706053