Fault Diagnosis Using t/k-Diagnosable System in Hypercube Networks 


Vol. 31,  No. 11, pp. 1044-1051, Nov.  2006


PDF
  Abstract

System level diagnosis algorithms use the properties of t-diagnosable system where the maximum number of the faults does not exceed t. The existing diagnosis algorithms have limit when dealing with large fault sets in large multiprocessor systems. Somani and Peleg proposed t/k-diagnosable system to diagnose more faults than t by allowing upper bounded few number of units to be diagnosed incorrectly. In this paper, we propose adaptive hypercube diagnosis algorithm using t/k-diagnosable system. When the number of faults exceeds t, we allow k faults to be diagnosed incorrectly. Simulation shows that the performance of the proposed algorithm is better than Feng's HADA algorithm. We propose new algorithm to reduce test rounds by analyzing the syndrome of RGC-ring obtained in the first step of HADA/IHADA method. The proposed algorithm also gives similar performance compared to HYP-DIAG algorithm.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Kim and C. Rhee, "Fault Diagnosis Using t/k-Diagnosable System in Hypercube Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 11, pp. 1044-1051, 2006. DOI: .

[ACM Style]

Jang-Hwan Kim and Chung-Sei Rhee. 2006. Fault Diagnosis Using t/k-Diagnosable System in Hypercube Networks. The Journal of Korean Institute of Communications and Information Sciences, 31, 11, (2006), 1044-1051. DOI: .

[KICS Style]

Jang-Hwan Kim and Chung-Sei Rhee, "Fault Diagnosis Using t/k-Diagnosable System in Hypercube Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 11, pp. 1044-1051, 11. 2006.