Issue No. 08 - August (1996 vol. 45)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.536232
<p><b>Abstract</b>—The classical <it>t</it>-diagnosability approach has its limitation when dealing with large fault sets in large multiprocessor systems. This is due to limited diagnosability of large multiprocessor systems connected using regular interconnection structures. We propose an alternative approach to system diagnosis by allowing a few upper bounded number of units to be diagnosed incorrectly. This measure is called <it>t</it>/<it>k</it>-diagnosability. Using this new measure, it is possible to increase the degree of diagnosability of large system considerably. The <it>t</it>/<it>k</it>-diagnosis guarantees that all the faulty units (processors) in a system are detected (provided the number of faulty units does not exceed <it>t</it>) while at most <it>k</it> units are incorrectly diagnosed. We provide necessary and sufficient conditions for <it>t</it>/<it>k</it>-diagnosability and discuss their implication. To demonstrate the power of this approach, we analyze the diagnosability of large systems connected as hypercube, star-graph, and meshes. It is shown that a substantial increase in the degree of diagnosability of these structures is achieved, compared with the degree of diagnosability achieved using the classic <it>t</it>-diagnosability approach, at the cost of a comparably small number of incorrectly diagnosed units.</p>
Fault diagnosis, system level diagnosis, t-diagnosable systems, t/k-diagnosable systems, degree of diagnosability, t/k-diagnosability of hypercubes, t/k-diagnosability of star-graph.
A. K. Somani and O. Peleg, "On Diagnosability of Large Fault Sets in Regular Topology-Based Computer Systems," in IEEE Transactions on Computers, vol. 45, no. , pp. 892-903, 1996.