Abstract
We propose an approach to organizing self-testing in a multiprocessor system under certain constraints; in particular, we use special diagnostic graphs, and the number of failures does not exceed a certain value T. We show that a test experiment where each of n processors is tested by two others lets one determine the state of all except possibly two processors for T = 4 and except one for T = 3. The total number of tests does not exceed 2n + 2.
Similar content being viewed by others
References
Preparata, F.P., Metze, G., and Chien, R.T., On the Connection Assignment Problem of Diagnosable Systems, IEEE Trans. Electron. Comput., 1967, vol. ES-16, no. 6, pp. 848–854.
Vedeshenkov, B.A., Organizing the Diagnostics of Digital Systems with the Structure of a Symmetric Bipartite Graph, Probl. Upravlen., 2009, no. 6, pp. 59–67.
Karavai, M.F. and Podlazov, B.S., Extended Generalized Hypercube as a Fault-Tolerant System Network for Multiprocessor Systems, Upravlen. Bol’shimi Sist., 2013, no. 45, pp. 344–371.
Barkun, M.A., Circulant Graphs, Proc. 15th Intl. Conf. “Moden Means of Communication,” Minsk: UO VGSK, 2010, pp. 16–22.
Dimitriev, Yu.K., On t-diagnosability of Multicore Systems with Symmetric Circulant Structure, Autom. Remote Control, 2013, vol. 74, no. 1, pp. 105–113.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.A. Romankevich, 2017, published in Avtomatika i Telemekhanika, 2017, No. 2, pp. 115–127.
This paper was recommended for publication by P.P. Parkhomenko, a member of the Editorial Board
Rights and permissions
About this article
Cite this article
Romankevich, V.A. Self-testing of multiprocessor systems with regular diagnostic connections. Autom Remote Control 78, 289–299 (2017). https://doi.org/10.1134/S0005117917020084
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117917020084