In this paper the technique of algorithm-based fault tolerance which is used to detect and correct transient or permanent hardware faults by checksum matrices is reconsidered for triangular systolic arrays. Linear error detecting arrays are developed for both matrix product and triangular factorisation and are shown to interface neatly with triangular schemes. The overheads associated with error detecting redundancy is offset by hardware reduction due to the folding of the array to produce triangular rather than the standard hex connected arrays. The result is shown to be improved efficiency and area efficient fault tolerant arrays
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...
Abstract. The general capabilities of fault tolerant computations in one-way and two-way linear cell...
Abstract- The rapid progress in VLSI technology has reduced the cost of hardware, allowing multiple ...
AbstractAn approach to design fault-tolerant hexagonal systolic array (SA) for multiplication of rec...
A fault-tolerant array for matrix multiplication that explicitly incorporates mechanisms for easy te...
With few exceptions, the two issues of algorithm design and fault tolerance for processor arrays hav...
163 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.The concept of algorithm-base...
We present a new approach to fault tolerance for High Performance Computing system. Our approach is ...
[[abstract]]Existing fault-tolerant matrix-inversion schemes suffer several drawbacks, such as being...
In this paper, we propose a new algorithm-based fault-tolerant method derived from the inherent natu...
International audienceThis paper compares several fault-tolerance methods for the detection and corr...
A common technique widely used to achieve fault tolerance in systolic arrays consists in incorporati...
Abstract In this brief an approach is proposed to achieve energy savings from reduced voltage opera...
In this paper, we extend the theory of algorithmic fault-tolerant matrix-matrix mul-tiplication, C =...
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...
Abstract. The general capabilities of fault tolerant computations in one-way and two-way linear cell...
Abstract- The rapid progress in VLSI technology has reduced the cost of hardware, allowing multiple ...
AbstractAn approach to design fault-tolerant hexagonal systolic array (SA) for multiplication of rec...
A fault-tolerant array for matrix multiplication that explicitly incorporates mechanisms for easy te...
With few exceptions, the two issues of algorithm design and fault tolerance for processor arrays hav...
163 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.The concept of algorithm-base...
We present a new approach to fault tolerance for High Performance Computing system. Our approach is ...
[[abstract]]Existing fault-tolerant matrix-inversion schemes suffer several drawbacks, such as being...
In this paper, we propose a new algorithm-based fault-tolerant method derived from the inherent natu...
International audienceThis paper compares several fault-tolerance methods for the detection and corr...
A common technique widely used to achieve fault tolerance in systolic arrays consists in incorporati...
Abstract In this brief an approach is proposed to achieve energy savings from reduced voltage opera...
In this paper, we extend the theory of algorithmic fault-tolerant matrix-matrix mul-tiplication, C =...
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...
Abstract. The general capabilities of fault tolerant computations in one-way and two-way linear cell...