On Fault Isolation and Identification in t1/t1-Diagnosable Systems
IEEE Transactions on Computers
A Generalized Theory for System Level Diagnosis
IEEE Transactions on Computers
Sequentially t-Diagnosable Systems: A Characterization and Its applications
IEEE Transactions on Computers - Special issue on fault-tolerant computing
(t, k)-Diagnosable System: A Generalization of the PMC Models
IEEE Transactions on Computers
Diagnosability of Two-Matching Composition Networks
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
| Hi-index | 14.98 |
A multiprocessing system is t/s-diagnosable if all faulty processors can be identified to within s processors, provided there are no more than t faulty processors. A characterization theorem of S. Karunanithi and A.D. Friedman (1979) for t/s-diagnosability in certain special cases of systems called designs is extended to the entire class of D/sub 1,t'/(n) designs. It is shown that for large t, s is approximately t/sup 2//4t'. Furthermore, the minimum number of processors needed to attain a given diagnosability is derived. A multiprocessor system is sequentially t-diagnosable if at least one faulty processor can be identified provided there are no more than t faulty processors. A theorem by F. Preparata, G. Metze, and R. Chien (1967), giving a sufficient condition for sequential t-diagnosability in the single-loop system (a special case of designs), is extended to the entire class of D/sub 1,t'/(n) designs. It is shown that, for large t, approximately t/sup 2//4t' nodes are needed for a D/sub 1,t'/(n) design to be sequentially t-diagnosable.