Abstract
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 σ , asserted by the algorithm itself. The correctness and completeness of NDA is studied through simulations on toroidal grids and hypercubes. Simulation results show that NDA provides a correct diagnosis even when the number of faults is very high (near half of the system size). The comparison between algorithm NDA and other diagnostic algorithms shows that NDA provides a better diagnosis, i.e., it has a higher degree of completeness than other diagnostic algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baldelli, L., Maestrini, P.: Self-diagnosis of array processors. In: Proceedings of the 24th International Symposium on Fault-Tolerant Computing, Austin, Texas, June 1994, pp. 48–53 (1994)
Blough, D., Sullivan, G., Masson, G.M.: Efficient diagnosis of multiprocessor system under probabilistic models. IEEE Transactions on Computers 41(9), 1126–1136 (1992)
Caruso, A., Chessa, S., Maestrini, P., Santi, P.: Diagnosis of regular structures. In: IEEE Proc. Dependable Systems and Networks, New York, NY, June 2000, pp. 213–222 (2000)
Caruso, A., Chessa, S., Maestrini, P., Santi, P.: Diagnosability of regular structures. Journal of Algorithms 45, 126–143 (2002)
Caruso, A., Chessa, S., Maestrini, P., Santi, P.: Evaluation of a diagnosis algorithm for regular structures. IEEE Transactions on Computers 51(7), 850–865 (2002)
Caruso, A., Chessa, S., Maestrini, P., Santi, P.: Fault–diagnosis of grid structures. In: Theoretical Computer Science. Elsevier, Amsterdam (January 2003)
Chessa, S.: Self-Diagnosis of Grid-Interconnected Systems with Application to Self-Test of VLSI Wafers. PhD thesis, TD-2/99, University of Pisa, Italy, Department of Computer Science (March 1999)
Dahbura, A.T., Masson, G.M.: An o(n2.5) fault identification algorithm for diagnosable systems. IEEE Transactions on Computers C-33(6), 486–492 (1984)
Hakimi, S.L., Amin, A.T.: Characterization of connection assignment of diagnosable systems. IEEE Transactions on Computers C-23(1), 86–88 (1974)
Huang, K., Agarwal, V.K., Thulasiraman, K.: A diagnosis algorithm for constant degree structures and its application to vlsi circuit testing. IEEE Transaction on Parallel and Distributed Systems 44(4), 363–372 (1995)
Huang, S., Xu, J., Chen, T.: Characterization and design of sequentially tdiagnosable systems. In: IEEE Proc. 19th International Symposium on Fault- Tolerant Computing, Washington, D.C., USA, June 1989, pp. 554–559 (1989)
Kavianpur, A., Kim, K.H.: A comparative evaluation of four basic system-level diagnosis strategies for hypercubes. IEEE Transactions on Reliability 41(1), 26–37 (1992)
Khanna, S., Fuchs, W.K.: A graph partitioning approch to sequential diagnosis. IEEE Transactions on Computers 46(1), 39–47 (1997)
LaForge, L.E., Huang, K., Argarwal, V.K.: Almost sure diagnosis of almost every good element. IEEE Transactions on Computers 43(3), 295–305 (1994)
Maestrini, P., Liu, C.L.: On the sequential diagnosability of a class of digital systems. In: IEEE Proc. 11th Int. Symp. on Fault-Tolerant Computing, June 1981, pp. 112–115 (1981)
Preparata, F.P., Metze, G., Chien, R.T.: On the connection assignment problem of diagnosable systems. IEEE Transactions on Computers EC-16(12), 848–854 (1967)
Raghavan, V., Tripathi, A.: Sequential diagnosability is co-NP complete. IEEE Transactions on Computers 40(5), 584–595 (1991)
Santi, P.: Evaluation of a Self-Diagnosis Algorithm for Regular Structures. PhD thesis, TD–6/00, University of Pisa, Italy, Department of Computer Science (March 2000)
Scheinerman, E.R.: Almost sure fault tolerance in random graphs. SIAM Journal on Computing 16(6), 1124–1134 (1987)
Somani, K., Agarwal, V.K.: Distributed diagnosis algorithm for regular interconnected systems. IEEE Transaction on Parallel and Distributed Systems 42(7), 899–906 (1992)
Sullivan, G.: A polynomial time algorithm for fault diagnosability. In: Proceedings of the 25th Int Symp. on Foundations of Computer Science, Los Angeles, Ca., USA, October 1984, pp. 148–156 (1984)
Sullivan, G.: An o(t 3 + |e|) fault identification algorithm for diagnosable systems. IEEE Transactions on Computers 37(2), 388–397 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caruso, A., Albini, L., Maestrini, P. (2003). A New Diagnosis Algorithm for Regular Interconnected Structures. In: de Lemos, R., Weber, T.S., Camargo, J.B. (eds) Dependable Computing. LADC 2003. Lecture Notes in Computer Science, vol 2847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45214-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-45214-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20224-0
Online ISBN: 978-3-540-45214-0
eBook Packages: Springer Book Archive