Organization of self-diagnosis of the discrete multicomponent systems a structure like bipartite quasicomplete graphs.
Saved in:
| Title: | Organization of self-diagnosis of the discrete multicomponent systems a structure like bipartite quasicomplete graphs. |
|---|---|
| Authors: | Parkhomenko, P.1 |
| Source: | Automation & Remote Control. May2009, Vol. 70 Issue 5, p907-915. 9p. 5 Diagrams, 1 Chart. |
| Subjects: | Computer organization, Computer systems, Telecommunication systems, Bipartite graphs, Graph theory |
| 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 s2( s − 1) + s of checks of single graph edges. [ABSTRACT FROM AUTHOR] |
| Copyright of Automation & Remote Control is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
