An approach to design fault-tolerant hexagonal systolic array (SA) for multiplication of rectangular matrices is described. The approach comprises three steps. First, redundancies are introduced at the computational level by deriving three equivalent algorithms but with disjoint index spaces. Second
Fault Tolerant Faddeeva Algorithm
β Scribed by Maura P. Connolly; Patrick Fitzpatrick
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 276 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
β¦ Synopsis
We present an algorithm based fault tolerant scheme suitable for array implementations of the Faddeeva algorithm. Our technique corrects errors due to multiple transient, intermittent, or permanent faults provided these are restricted to a single column of the array. We show how to find the location of the faulty column and to determine the correct Schur complement from the erroneous one. The fault recovery algorithm is of quadratic complexity in the number of rows of the input matrix while the hardware overhead is approximately four times the number of rows.
π SIMILAR VOLUMES
We investigate fault-tolerant routing schemes which aim at using low number of virtual channels in wormhole-routed mesh networks. The faults under consideration are rectangular block faults, which are suitable for modeling faults on board level in networks with grid structures. There is no restricti
Fault tolerant motion planning of two spatial coordinating manipulators having two possible locked joints respectively is studied. First, the calculation method of fault tolerant workspace with respect to different joints is given, and the centrality index that measures the relative position between