PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Caruso A., Albini L. C., Maestrini P. A New Diagnosis Algorithm for Regular Interconnected Structures. In: First Latin American Symposium (Sao Paulo, Brasil, October 2003). Proceedings, pp. 263 - 281. Rogerio de Lemos et al. (eds.). (Lecture Notes in Computer Science, vol. 2847). Springler, 2003.
 
 
Abstract
(English)
We present a new diagnosis algorithm (NDA) for regular interconnected structures. The diagnosis algorithm has time complexity $O(kn)$ when applied to $k$-regular systems of $n$ units. It provides a correct diagnosis, although incomplete. The diagnosis is correct if the number of faulty units is not above a specified bound $T_sigma$, asserted by the algorithm itself. The correctness and completeness of ALG is studied through simulations on toroidal grids and hypercubes. Simulation results show that ALG provides a correct diagnosis even when the number of faults is very high (near half of the system size). The comparison between algorithm ALG and other diagnostic algorithms shows that ALG provides a better diagnosis, i.e., it has an higher degree of completeness than other diagnostic algorithms.
URL: http://www.springerlink.com/app/home/contribution.asp?wasp=6cc6l524tjdjtl49up4u
Subject Diagnosis
regular systems
algorithms
fault tolerance reliability
reliability
B.8.1 Reliability, Testing, and Fault-Tolerance


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional