• Publication
  • 2011
  • Issue No. 10 - Oct.
  • Abstract - Conditional-Fault Diagnosability of Multiprocessor Systems with an Efficient Local Diagnosis Algorithm under the PMC Model
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Conditional-Fault Diagnosability of Multiprocessor Systems with an Efficient Local Diagnosis Algorithm under the PMC Model
Oct. 2011 (vol. 22 no. 10)
pp. 1669-1680
Cheng-Kuan Lin, National Chiao Tung University, Hsinchu
Tzu-Liang Kung, Asia University, Taichung
Jimmy J.M. Tan, National Chiao Tung University, Hsinchu
Diagnosis is an essential subject for the reliability of multiprocessor systems. Under the PMC diagnosis model, Dahbura and Masson [12] proposed a polynomial-time algorithm with time complexity O(N^{2.5}) to identify all the faulty processors in a system with N processors. In this paper, we present a novel method to diagnose a conditionally faulty system by applying the concept behind the local diagnosis, introduced by Somani and Agarwal [30], and formalized by Hsu and Tan [18]. The goal of local diagnosis is to identify the fault status of any single processor correctly. Under the PMC diagnosis model, we give a sufficient condition to estimate the local diagnosability of a given processor. Furthermore, we propose a helpful structure, called the augmenting star, to efficiently determine the fault status of each processor. For an N-processor system in which every processor has an O(\log N) degree, the time complexity of our algorithm to diagnose any given processor is O((\log N)^2), provided that each processor can construct an augmenting star structure of full order in time O((\log N)^2) and the time for a processor to test another one is constant. Therefore, the time totals to O(N(\log N)^2) for diagnosing the whole system.

[1] S.B. Akers and B. Krishnamurthy, "A Group-Theoretic Model for Symmetric Interconnection Networks," IEEE Trans. Computers, vol. 38, no. 4, pp. 555-566, Apr. 1989.
[2] J. Altmann, T. Bartha, and A. Pataricza, "An Event-Driven Approach to Multiprocessor Diagnosis," Proc. Eighth Symp. MicroProcessor and Microcomputer Applications, vol. 1, pp. 109-118, 1994.
[3] F. Barsi, F. Grandoni, and P. Maestrini, "A Theory of Diagnosability of Digital Systems," IEEE Trans. Computers, vol. 25, no. 6, pp. 585-593, June 1976.
[4] T.A. Bartic, J.Y. Mignolet, V. Nollet, T. Marescaux, D. Verkest, S. Vernalde, and R. Lauwereins, "Topology Adaptive Network-on-Chip Design and Implementation," IEEE Proc. Computers and Digital Techniques, vol. 152, no. 4, pp. 467-472 , July 2005.
[5] J.A. Bondy and U.S.R. Murty, Graph Theory. Springer, 2008.
[6] A. Caruso, S. Chessa, P. Maestrini, and P. Santi, "Evaluation of a Diagnosis Algorithm for Regular Structures," IEEE Trans. Computers, vol. 51, no. 7, pp. 850-865, July 2002.
[7] A. Caruso, S. Chessa, P. Maestrini, and P. Santi, "Fault-Diagnosis of Grid Structures," Theoretical Computer Science, vol. 290, no. 2, pp. 1149-1174, Jan. 2003.
[8] A. Caruso, L. Albini, and P. Maestrini, "A New Diagnosis Algorithm for Regular Interconnected Structures," Lecture Notes in Computer Science, pp. 264-281, Springer-Verlag, 2003.
[9] A. Caruso, S. Chessa, and P. Maestrini, "Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model," IEEE Trans. Computers, vol. 56, no. 7, pp. 917-924, July 2007.
[10] S. Chessa and P. Maestrini, "Correct and Almost Complete Diagnosis of Processor Grids," IEEE Trans. Computers, vol. 50, no. 10, pp. 1095-1102, Oct. 2001.
[11] S.A. Choudum and V. Sunitha, "Augmented Cubes," Networks, vol. 40, no. 2, pp. 71-84, Sept. 2002.
[12] A. Dahbura and G. Masson, "An $O(N^{2.5})$ Fault Identification Algorithm for Diagnosable Systems," IEEE Trans. Computers, vol. 33, no. 6, pp. 486-492, June 1984.
[13] A. Das, K. Thulasiraman, V.K. Agarwal, and K.B. Lakshmanan, "Multiprocessor Fault Diagnosis under Local Constraints," IEEE Trans. Computers, vol. 42, no. 8, pp. 984-988, Aug. 1993.
[14] K. Efe, "A Variation on the Hypercube with Lower Diameter," IEEE Trans. Computers, vol. 40, no. 11, pp. 1312-1316, Nov. 1991.
[15] A.D. Friedman and L. Simoncini, "System-Level Fault Diagnosis," The Computer J., vol. 13, no. 3, pp. 47-53, Mar. 1980.
[16] S.L. Hakimi and A.T. Amin, "Characterization of Connection Assignment of Diagnosable Systems," IEEE Trans. Computers, vol. C-23, no. 1, pp. 86-88, Jan. 1974.
[17] S.-Y. Hsieh and T.-Y. Chuang, "The Strong Diagnosability of Regular Networks and Product Networks under the PMC Model," IEEE Trans. Parallel and Distributed Systems, vol. 20, no. 3, pp. 367-378, Mar. 2009.
[18] G.-H. Hus and J.J.M. Tan, "A Local Diagnosability Measure for Multiprocessor Systems," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 5, pp. 598-607, May 2007.
[19] A. Kavianpour and K.H. Kim, "Diagnosability of Hypercube under the Pessimistic One-Step Diagnosis Strategy," IEEE Trans. Computers, vol. 40, no. 2, pp. 232-237, Feb. 1991.
[20] P.-L. Lai, J.J.M. Tan, C.-P. Chang, and L.-H. Hsu, "Conditional Diagnosability Measures for Large Multiprocessor Systems," IEEE Trans. Computers, vol. 54, no. 2, pp. 165-175, Feb. 2005.
[21] F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.
[22] M. Mánik and E. Gramatová, "Boolean Formalisation of the PMC Model for Faulty Units Diagnosis in Regular Multi-Processor Systems," Proc. 11th IEEE Workshop Design and Diagnostics of Electronic Circuits and Systems (DDECS), pp. 1-2, Apr. 2008.
[23] M. Mánik and E. Gramatová, "Diagnosis of Faulty Units in Regular Graphs under the PMC Model," Proc. 12th Int'l Symp. Design and Diagnostics of Electronic Circuits and Systems (DDECS), pp. 202-205, Apr. 2009.
[24] H. Masuyama and T. Miyoshi, "A Non-Adaptive Distributed System-Level Diagnosis Method for Computer Networks," Proc. Int'l Conf. Comm. Systems and Networks, 2003.
[25] W. Najjar and J.L. Gaudiot, "Network Resilience: A Measure of Network Fault Tolerance," IEEE Trans. Computers, vol. 39, no. 2, pp. 174-181, Feb. 1990.
[26] P.P. Pande, C. Grecu, M. Jones, A. Ivonov, and R. Saleh, "Performance Evaluation and Design Trade-Offs for Network-on-Chip Interconnect Architectures," IEEE Trans. Computers, vol. 54, no. 8, pp. 1025-1040, Aug. 2005.
[27] F.P. Preparata, G. Metze, and R.T. Chien, "On the Connection Assignment Problem of Diagnosis Systems," IEEE Trans. Electronic Computers, vol. 16, no. 6, pp. 848-854, Dec. 1967.
[28] Y. Saad and M.H. Shultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.
[29] A.K. Somani, V.K. Agarwal, and D. Avis, "A Generalized Theory for System Level Diagnosis," IEEE Trans. Computers, vol. 36, no. 5, pp. 538-546, May 1987.
[30] A.K. Somani and V.K. Agarwal, "Distributed Diagnosis Algorithm for Regular Interconnected Systems," IEEE Trans. Parallel and Distributed Systems, vol. 42, no. 7, pp. 899-906, July 1992.
[31] M. Xu, K. Thulasiraman, and X.-D. Xu, "Conditional Diagnosability of Matching Composition Networks under the PMC Model," IEEE Trans. Circuits and Systems-II: Express Briefs, vol. 56, no. 11, pp. 875-879, Nov. 2009.

Index Terms:
Fault diagnosis, PMC model, diagnosability, reliability, diagnosis algorithm.
Citation:
Cheng-Kuan Lin, Tzu-Liang Kung, Jimmy J.M. Tan, "Conditional-Fault Diagnosability of Multiprocessor Systems with an Efficient Local Diagnosis Algorithm under the PMC Model," IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 10, pp. 1669-1680, Oct. 2011, doi:10.1109/TPDS.2011.46
Usage of this product signifies your acceptance of the Terms of Use.