Title :
Configuration of locally spared arrays in the presence of multiple fault types
Author :
LaForge, Laurence E.
Author_Institution :
Right Stuff of Tahoe, Reno, NV, USA
fDate :
4/1/1999 12:00:00 AM
Abstract :
The bulk of results for the performance of configuration architectures treat the case of failed processors, but neglect switches that are stuck open or closed. By contrast, the present work characterizes this multivariate problem in the presence of either iid or clustered faults. Suppose that the designer wishes to assure, with high probability, a fault free s×t array. If local sparing is used then, as we prove, the area of the redundant array is 1) θ(st log st) in the presence of faulty elements or faulty elements and switches stuck open; 2) θ(st log2 st) in the presence of faulty elements and switches stuck closed; 3) θ([st]2 log st) in the presence of faulty elements and switches that may be either stuck open or stuck closed. We also furnish bounds on maximum wirelength and an optimal configuration algorithm
Keywords :
fault tolerant computing; systolic arrays; configuration algorithm; configuration architectures; fault tolerance; local sparing; locally spared arrays; maximum wirelength; optimal configuration algorithm; systolic arrays; Binary trees; Boosting; Costs; Fault tolerant systems; Hypercubes; Redundancy; Switches; Systolic arrays; Testing; Wires;
Journal_Title :
Computers, IEEE Transactions on