Optimal matrix multiplication on fault-tolerant VLSI arrays
نویسندگان
چکیده
منابع مشابه
Optimal Matrix Multiplication on Fault-Tolerant VLSI Arrays
where h is the decision tree height, or the number of radial cuts, whose i cross edges can be chosen independently: h = (f L-k-l) / (f-1). Therefore, the number of permutations having the number of cross edges i = 1 in a stage-k subgraph of an (3, L) CC-banyan is C;,k=3(3L-k-1)/2, 0 < k < L-2. Now we can evaluate the total number of permutations in CC-banyan with fan-out 3. Theorem 6: The numbe...
متن کاملFault-Tolerant High-Performance Matrix Multiplication: Theory and Practice
In this paper, we extend the theory and practice regarding algorithmic fault-tolerant matrix-matrix multiplication, C = AB, in a number of ways. First, we propose low-overhead methods for detecting errors introduced not only in C but also in A and/or B. Second, we show that, theoretically, these methods will detect all errors as long as only one entry is corrupted. Third, we propose a low-overh...
متن کاملFault-Tolerant Distributed Algorithms on VLSI Chips
The Dagstuhl seminar 08371 on Fault-Tolerant Distributed Algorithms on VLSI Chips was devoted to exploring whether the wealth of existing fault-tolerant distributed algorithms research can be utilized for meeting the challenges of futuregeneration VLSI chips. Participants from both the distributed fault-tolerant algorithms community, interested in this emerging application domain, and from the ...
متن کاملOptimal Reconfiguration Algorithms for Real-Time Fault-Tolerant Processor Arrays
-In this paper we consider the problem of reconfiguring processor arrays subject to computational loads that alternate between two modes. A strict mode is characterized by a heavy computational load and severe constraints on response time while a relaxed mode is characterized by a relatively light computational load and relaxed constraints on response time. In the strict mode, reconfiguration i...
متن کاملFault-tolerant parallel matrix multiplication with one iteration fault detection latency
The checksum technique is a low cost method to detect errors in matrix operations performed by processor arrays. The fault detection of this method is done only at problem termination, so this method is not an effective fault tolerance technique for large scale matrix multiplication. This paper presents a new algorithm, the ID algorithm, which minimizes the fault-detection latency, In the ID al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 1989
ISSN: 0018-9340
DOI: 10.1109/12.16505