A New Algorithm Based on Givens Rotations for Solving Linear Equations on Fault-Tolerant Mesh-Connected Processors

Authors:
K.N. Balasubramanya Murthy;K. Bhuvaneswari;C. Siva Ram Murthy
Affiliations:
Malnad College of Engineering, Hassan, India;India Development Center, Embassy Point;Indian Institute of Technology, Madras, India
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1998

Citing 5
Cited 3

On the direct parallel solution of systems of linear equations: new algorithms and systolic structures

Information Sciences: an International Journal
Modified Faddeeva Algorithm for Concurrent Execution of Linear Algebraic Operations

IEEE Transactions on Computers
Algorithm-based fault tolerance for matrix inversion with maximum pivoting

Journal of Parallel and Distributed Computing
On Stable Parallel Linear System Solvers

Journal of the ACM (JACM)
Partitioned Encoding Schemes for Algorithm-Based Fault Tolerance in Massively Parallel Systems

IEEE Transactions on Parallel and Distributed Systems

An Efficient Algorithm-Based Fault Tolerance Design Using the Weighted Data-Check Relationship

IEEE Transactions on Computers
Dynamic Iterative Method for Fast Network Partitioning

HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
Parallel Edge Coloring of a Tree on a Mesh Connected Computer

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

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.