[[abstract]]Existing fault-tolerant matrix-inversion schemes suffer several drawbacks, such as being limited to fault detection, requiring rollback to resume computation, cost ineffectiveness, instability, significant roundoff errors, and potential false alarms. In this paper, an algorithm-based fault-tolerant scheme for matrix inversion with maximum pivoting that can rectify the above problems is presented. This scheme can correct a single fault and detect multiple faults in each row and column in each iteration within a computation. The sequential and parallel algorithms based on checksums to support the fault-tolerant capability are developed. In this scheme, redundant processing elements needed and additional overhead for the enhanced f...
The mean time between failure (MTBF) of large supercomputers is decreasing, and future exascale comp...
163 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.The concept of algorithm-base...
n the last two decades several NC algorithms for solving basic linear algebraic problems have appear...
Abstract- The rapid progress in VLSI technology has reduced the cost of hardware, allowing multiple ...
We present a new approach to fault tolerance for High Performance Computing system. Our approach is ...
With the proliferation of parallel and distributed systems, it is an increasingly important problem ...
In this paper, we extend the theory of algorithmic fault-tolerant matrix-matrix mul-tiplication, C =...
In this paper the technique of algorithm-based fault tolerance which is used to detect and correct t...
A fault-tolerant array for matrix multiplication that explicitly incorporates mechanisms for easy te...
AbstractAn approach to design fault-tolerant hexagonal systolic array (SA) for multiplication of rec...
With few exceptions, the two issues of algorithm design and fault tolerance for processor arrays hav...
As the desire of scientists to perform ever larger computations drives the size of today’s high perf...
International audienceThis paper compares several fault-tolerance methods for the detection and corr...
This paper presents an algorithm based fault tolerance method to harden three two-sided matrix facto...
Dense matrix factorizations, like LU, Cholesky and QR, are widely used for scientific applications t...
The mean time between failure (MTBF) of large supercomputers is decreasing, and future exascale comp...
163 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.The concept of algorithm-base...
n the last two decades several NC algorithms for solving basic linear algebraic problems have appear...
Abstract- The rapid progress in VLSI technology has reduced the cost of hardware, allowing multiple ...
We present a new approach to fault tolerance for High Performance Computing system. Our approach is ...
With the proliferation of parallel and distributed systems, it is an increasingly important problem ...
In this paper, we extend the theory of algorithmic fault-tolerant matrix-matrix mul-tiplication, C =...
In this paper the technique of algorithm-based fault tolerance which is used to detect and correct t...
A fault-tolerant array for matrix multiplication that explicitly incorporates mechanisms for easy te...
AbstractAn approach to design fault-tolerant hexagonal systolic array (SA) for multiplication of rec...
With few exceptions, the two issues of algorithm design and fault tolerance for processor arrays hav...
As the desire of scientists to perform ever larger computations drives the size of today’s high perf...
International audienceThis paper compares several fault-tolerance methods for the detection and corr...
This paper presents an algorithm based fault tolerance method to harden three two-sided matrix facto...
Dense matrix factorizations, like LU, Cholesky and QR, are widely used for scientific applications t...
The mean time between failure (MTBF) of large supercomputers is decreasing, and future exascale comp...
163 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.The concept of algorithm-base...
n the last two decades several NC algorithms for solving basic linear algebraic problems have appear...