Abstract
Organization of an efficient self-diagnosis of the multicomponent computer and communication systems of diverse structures always attracted attention of the researchers and engineers. A method to solve these problems is presented in the paper by way of the example of a system whose structure is modeled by a uniform ordinary bipartite graph of diameter d = 3, any degree s > 1, and any number n of vertices, where n = s(s − 1) + 1. The method requires checking of (s − 1)3 graph loops of length eight each, which is smaller than the number s 2(s − 1) + s of checks of single graph edges.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Preparata, F.P., Metze, G., and Chien, R.T., On the Connection Assignment Problem of Diagnosis System, IEEE Trans. Electron. Comput., 1967, vol. 16, no. 12
Barsi, F., Grandoni, F., and Maestrini, P., A Theory of Diagnosability of Digital Systems, IEEE Trans. Comput., 1976, vol. C-25, no. 6, pp. 585–593.
Malek, M., A Comparision Connection of Assignment for Diagnosis of Multiprocessor system, Proc. Seventh Int. Symp. Comput. Architecture, 1980, pp. 31–35.
Armstrong, J.R. and Gray, F.G., Fault Diagnosis in a Boolean n Cube Array of Microprocessors, IEEE Trans. Comput., 1981, vol. C-30, no. 8, pp. 587–590.
Parkhomenko, P.P., On System Diagnosis of Vertex and Edge Hypercube Structures of Multiprocessor Systems, Autom. Remote Control, 1996, no. 11, pp. 1668–1675.
Vedeshenkov, V.A., System Diagnosis of the Failed Modules and Connections in Hypercube Structures of the Multiprocessor Computer Systems, Autom. Remote Control, 2001, no. 12, pp. 2004–2014.
Chessa, S., Maestrini, P., Sollay, B., et al., Self-diagnostic Tools of the APEmille parallel machine, IEE Proc. Comput. Digit. Tech., 2002, vol. 149, no. 6, pp. 273–279.
Zykov, A.A., Osnovy teorii grafov (Fundamental of the Graph Theory), Moscow: Nauka, 1987.
Berge, C., Theorie des graphes et ses applications, Paris: Dunod, 1958. Translated under the title Teoriya grafov i ee primeneniya, Moscow: Inostrannaya Literatura, 1962.
Hall, M., Combinatorial Theory, Blaisdell, Waltham: Blaisdell, 1967. Translated under the title Kombinatorika, Moscow: Mir, 1970.
Karavai, M.F., Parkhomenko, P.P., and Podlazov, V.S., Combinatorial Methods for Constructing Bipartite Uniform Minimal Quasicomplete Graphs (Symmetrical Block Designs), Autom. Remote Control, 2009, no. 2, pp. 312–327.
Zakrevskii, A.D., Algoritmy sinteza diskretnykh avtomatov (Algorithms to Design Discrete Automata), Moscow: Nauka, 1971.
Author information
Authors and Affiliations
Additional information
Original Russian Text © P.P. Parkhomenko, 2009, published in Avtomatika i Telemekhanika, 2009, No. 5, pp. 180–189.
Rights and permissions
About this article
Cite this article
Parkhomenko, P.P. Organization of self-diagnosis of the discrete multicomponent systems a structure like bipartite quasicomplete graphs. Autom Remote Control 70, 907–915 (2009). https://doi.org/10.1134/S0005117909050166
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117909050166