This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sequential Fault Occurrence and Reconfiguration in System Level Diagnosis
December 1990 (vol. 39 no. 12)
pp. 1472-1475

In a classical system-level diagnosis model, a complex multiprocessor system is characterized to be uniquely diagnosable under the presence of any arbitrary fault set of size up to t. Fault occurrence, however, is usually a sequential process in real-life systems, i.e. multiple faults occur one after another. Any faulty location is immediately diagnosed and the system is reconfigured before any further fault occurs. Systems which are designed under the assumption of sequential fault occurrences and reconfiguration are discussed and their test interconnection assignment for unique diagnosability is characterized. A theorem is developed for sequential k/t-diagnosability, where the system is allowed to have up to t faults but not more than k of them occur at a time. For most practical cases, k has a value of 1. The t-diagnosability theorem is then a special case of this theorem for k=Kt. The results of this theorem are more useful in the design practical systems where the system is reconfigured after every fault is detected and located, and they do not have to satisfy the constraints n<2≥t.

[1] F. P. Preparata, G. Metze, and R. T. Chien, "On the connection assignment problem of diagnosable systems,"IEEE Trans. Electron. Comput., vol. EC-16, no. 6, pp. 848-854, Dec. 1967.
[2] S. L. Hakimi and A. T. Amin, "Characterization of connection assignment of diagnosable systems,"IEEE Trans. Comput., vol. C-23, no. 1, pp. 86-88, Jan. 1974.
[3] F. Barsi, F. Grandoni, and P. Maestrini, "A theory of diagnosability for digital systems,"IEEE Trans. Comput., vol. C-25, no. 6, pp. 585-593, June 1976.
[4] A. T. Dahbura and G. M. Masson, "AnO(n2.5) fault identification algorithm for diagnosable systems,"IEEE Trans. Comput., vol. C-33, 1984.
[5] G. F. Sullivan, "A polynomial time algorithm for fault diagnosability," inProc. Foundations Comput. Sci., 1984, pp. 148-156.
[6] A. K. Somani, "A unified theory of system-level diagnosis and its application to regular interconnected structures," Ph.D. dissertation, Dep. Elec. Eng., McGill Univ., Montreal.
[7] A. K. Somani, V. K. Agrawal, and D. Avis, "A generalized theory for system level diagnosis,"IEEE Trans. Comput., vol. C-36, pp. 538-546, May 1987.
[8] F. J. Allan, T. Kameda, and S. Toida, "An approach to the diagnosability analysis of a system,"IEEE Trans. Comput., vol. C-24, pp. 1040-1042, 1974.

Index Terms:
sequential fault occurrence; reconfiguration; system level diagnosis; complex multiprocessor system; test interconnection assignment; sequential k/t-diagnosability; fault tolerant computing; multiprocessor interconnection networks.
Citation:
A.K. Somani, "Sequential Fault Occurrence and Reconfiguration in System Level Diagnosis," IEEE Transactions on Computers, vol. 39, no. 12, pp. 1472-1475, Dec. 1990, doi:10.1109/12.61067
Usage of this product signifies your acceptance of the Terms of Use.