The Community for Technology Leaders
Green Image
<p>The authors study fault-tolerant redundant structures for maintaining reliable arrays. In particular, they assume that the desired array (application graph) is embedded in a certain class of regular, bounded-degree graphs called dynamic graphs. The degree of reconfigurability (DR) and DR with distance (DR/sup d/) of a redundant graph are defined. When DR and DR/sup d/ are independent of the size of the application graph, the graph is finitely reconfigurable (FR) and locally reconfigurable (LR), respectively. It is shown that DR provides a natural lower bound on the time complexity of any distributed reconfiguration algorithm and that there is no difference between being FR and LR on dynamic graphs. It is also shown that if both local reconfigurability and a fixed level of reliability are to be maintained, a dynamic graph must be of a dimension at least one greater than the application graph. Thus, for example, a one-dimensional systolic array cannot be embedded in a one-dimensional dynamic graph without sacrificing either reliability or locality of reconfiguration.</p>
systolic arrays; wavefront arrays; reconfigurability; reliability; fault-tolerant redundant structures; reliable arrays; application graph; bounded-degree graphs; dynamic graphs; finitely reconfigurable; locally reconfigurable; lower bound; time complexity; fault tolerant computing; reconfigurable architectures; systolic arrays.
K. Steiglitz, E.H.-M. Sha, "Reconfigurability and Reliability of Systolic/Wavefront Arrays", IEEE Transactions on Computers, vol. 42, no. , pp. 854-862, July 1993, doi:10.1109/12.237725
48 ms
(Ver 3.3 (11022016))