Diagnosabilities of hypercubes under the pessimistic one-step diagnosis strategy

Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model

“…In [3,7,16,22], the diagnosabilities of hypercubes, enhanced hypercubes, and Möius cubes were studied under the two diagnosis strategies. All these graphs have the similar diagnosabilities under the two diagnosis strategies.…”

“…Another representative diagnosis strategy based on the PMC diagnostic model was proposed by Friedman [11] and is called the pessimistic strategy [16], which defines the diagnosability of a system as follows.…”

A (4n−9)/3 diagnosis algorithm on n-dimensional cube network

“…The diagnosis algorithms for hypercube have been developed under precise and pessimistic diagnosis strategies; Feng et al [8] devised a precise diagnosis algorithm on hypercube, which was improved by Kranakis and Pelc [12], and Yang [20] presented an efficient pessimistic diagnosis algorithm on hypercube. The diagnosabilities of hypercube under pessimistic and t/k diagnosis strategies were determined by Kavianpour and Kim [11] and Somani and Peleg [17], respectively; thereby we know that an n-D cube is n/0-diagnosable, (2n À 2)/1-diagnosable, (3n À 5)/2-diagnosable, (4n À 9)/3-diagnosable, etc. In the case k P 2, an efficient t/k diagnosis algorithm of hypercube remains yet to be developed.…”

On conditional diagnosability of the folded hypercubes☆

“…A system is said to be t-diagnosable if all faulty units can be identified provided the number of faulty units present does not exceed t. The diagnosability of a system is the maximal number of faulty processors that the system can guarantee to diagnose. The diagnosability of many interconnection networks have been explored [1][2][3][5][6][7][8][9]15,24,25].…”