Catastrophic faults in reconfigurable systolic linear arrays
نویسندگان
چکیده
منابع مشابه
Catastrophic Faults in Reconfigurable Systolic Linear Arrays
In regular architectures of identical processing elements, a widely used technique to improve the reconngurability of the system consists of providing redundant processing elements and connections together with mechanisms of reconnguration. In this paper we consider linear arrays of processing elements, with unidirectional bypass links of length g. We study those sets of faulty processing eleme...
متن کاملCharacterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links
The catastrophic fault pattern is a pattern of faults occurring at strategic locations that may render a system unusable regardless of its component redundancy and of its reconfiguration capabilities. In this paper, we extend the characterization of catastrophic fault patterns known for linear arrays to two-dimensional VLSI arrays in which all links are unidirectional. We determine the minimum ...
متن کاملLinear Algebra in One-Dimensional Systolic Arrays
Frequently used problems of linear algebra, such as the solution of linear systems, triangular decomposition and matrix multiplication, are computationally extensive. To increase the speed, those problems should be solved with systolic structures, where many processors are used concurrently to compute the result. Since two-dimensional array of processors is very consumptive, considering space a...
متن کاملSome Linear-Time Algorithms for Systolic Arrays
We survey some recent results on linear-time algorithms for systolic arrays. In particular, we show how the greatest common divisor (GCD) of two polynomials of degree n over a finite field can be computed in time O(n) on a linear systolic array of O(n) cells; similarly for the GCD of two n-bit binary numbers. We show how n by n Toeplitz systems of linear equations can be solved in time O(n) on ...
متن کاملLinear Systolic Arrays for Computing Transitive Closure
This paper addresses the problem of computing transitive closure of a given directed graph on linear systolic arrays (SA). We have designed three linear SAs, including two static SAs and a bi-directional SA. Then we compare obtained arrays in term of execution time, number of processing elements and efficiency.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(96)00090-x