Diagnosis resolution of processors’ network using the comparison method

In the paper the model of the comparison diagnosis was introduced in an original way. The rules of comparison diagnosis were described. The notion t-detectability of an interconnection network was introduced with the necessary conditions of its existence. The dependencies for determination of the minimal number of complete t-detectable and t-diagnosable tests from the number of processors in an interconnection network were formulated. The model of an alternative pattern of the unsuitable states of a network based on the syndromes' model was also presented. Streszczenie. W oryginalny sposob przedstawiono model diagnostyki porownawczej. Określono reguly diagnozowania porownawczego. Wprowadzono pojecie t-detekcyjności sieci oraz określono konieczne warunki istnienia takiej sieci. Podano zalezności, ktore wyznaczają minimalną liczbe prob porownawczych niezbedną do tego, aby istnial kompletny test t-detekcyjny oraz kompletny test t-lokalizacyjny sieci o określonej liczbie procesorow. Przedstawiono sposob wyznaczania wzorca alternatywnych stanow niezdatności sieci na podstawie wzorca syndromow sieci. (Wnikliwośc diagnozowania sieci procesorow metodą porownawczą)

[1]  Stefano Chessa,et al.  Diagnosability of regular systems , 2002, J. Algorithms.

[2]  S. Louis Hakimi,et al.  Characterization of Connection Assignment of Diagnosable Systems , 1974, IEEE Transactions on Computers.

[3]  Kyung-Yong Chwa,et al.  Schemes for Fault-Tolerant Computing: A Comparison of Modularly Redundant and t-Diagnosable Systems , 1981, Inf. Control..

[4]  Jimmy J. M. Tan,et al.  The diagnosability of the matching composition network under the comparison diagnosis model , 2004, IEEE Transactions on Computers.

[5]  Fabrizio Grandoni,et al.  A Theory of Diagnosability of Digital Systems , 1976, IEEE Transactions on Computers.

[6]  Gerard J. Chang,et al.  (t, k) - Diagnosis for Matching Composition Networks under the MM* Model , 2007, IEEE Transactions on Computers.

[7]  Gerard J. Chang,et al.  (t; k)-Diagnosis for matching composition networks , 2006, IEEE Transactions on Computers.

[8]  J. Chudzikiewicz,et al.  Reconfiguration of the ring structure in a hypercube computer network with faulty links , 1999 .

[9]  Dajin Wang.  Diagnosability of Hypercubes and Enhanced Hypercubes under the Comparison Diagnosis Model , 1999, IEEE Trans. Computers.

[10]  Miroslaw Malek,et al.  A comparison connection assignment for diagnosis of multiprocessor systems , 1980, ISCA '80.

[11]  Yukio Shibata,et al.  (t, k)-Diagnosable System: A Generalization of the PMC Models , 2003, IEEE Trans. Computers.

[12]  Abhijit Sengupta,et al.  On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach , 1992, IEEE Trans. Computers.

[13]  GERNOT METZE,et al.  On the Connection Assignment Problem of Diagnosable Systems , 1967, IEEE Trans. Electron. Comput..

[14]  Sun-Yuan Hsieh,et al.  Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model , 2008, IEEE Transactions on Computers.

[15]  Arun K. Somani,et al.  On Diagnosability of Large Fault Sets in Regular Topology-Based Computer Systems , 1996, IEEE Trans. Computers.

[16]  Z. Zieliński.  Algorytm wyznaczania wzorca alternatywnych stanów niezdatności systemu diagnozowanego metodą opiniowania diagnostycznego , 2008 .

[17]  Lih-Hsing Hsu,et al.  Diagnosability of t-connected networks and product networks under the comparison diagnosis model , 2004, IEEE Transactions on Computers.

[18]  Yuan Yan Tang,et al.  Efficient Fault Identification of Diagnosable Systems under the Comparison Model , 2007, IEEE Transactions on Computers.

[19]  Jimmy J. M. Tan,et al.  Conditional diagnosability measures for large multiprocessor systems , 2005, IEEE Transactions on Computers.

[20]  Jie Xu,et al.  Sequentially t-Diagnosable Systems: A Characterization and Its Applications , 1995, IEEE Trans. Computers.