On a problem of Yuzvinsky on separating the n-cube
Discrete Mathematics
A lower bound on the size of a complex generated by an antichain
Discrete Mathematics
Sequential Diagnosability is Co-NP Complete
IEEE Transactions on Computers
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
A Graph Partitioning Approach to Sequential Diagnosis
IEEE Transactions on Computers
Diagnosability of regular systems
Journal of Algorithms
Reducing the Number of Sequential Diagnosis Iterations in Hypercubes
IEEE Transactions on Computers
On sequential diagnosis of multiprocessor systems
Discrete Applied Mathematics
System Fault Diagnosis: Closure and Diagnosability with Repair
IEEE Transactions on Computers
Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
Information Sciences: an International Journal
Interactive Communication, Diagnosis and Error Control in Networks
Algorithmics of Large and Complex Networks
Conditional diagnosability of hypermeshes under the comparison model
Information Processing Letters
Bibliography of publications by Rudolf Ahlswede
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.05 |
We consider problems of fault diagnosis in multiprocessor systems. Preparata, Metze and Chien [F.P. Preparata, G. Metze, R.T. Chien, On the connection assignment problem of diagnosable systems, IEEE Trans. Comput. EC 16 (12) (1967) 848-854] introduced a graph theoretical model for system-level diagnosis, in which processors perform tests on one another via links in the system. Fault-free processors correctly identify the status of tested processors, while the faulty processors can give arbitrary test results. The goal is to identify faulty processors based on the test results. A system is said to be t-diagnosable if faulty units can be identified, provided the number of faulty units present does not exceed t. We explore here diagnosis problems for n-cube systems and give bounds for diagnosability of the n-cube. We also describe a simple diagnosis algorithm A which is linear in time and which can be used for sequential diagnosis as well as for incomplete diagnosis in one step. In particular, the algorithm applied to arbitrary topology based interconnection systems G with N processors improves previously known ones. It has sequential diagnosability t"A(G)=@?2N^1^2@?-3, which is optimal in the worst case.