Conditions of Independence of Structural Robustness of Embedded Diagnostic Graph on the Numbering of Modules of A Computing System With Toroidal Structure
Yu.K. Dimitriev
Novosibirsk
Pages: 62-72
Abstract
Fault-tolerant mass-parallel computing systems with point-to-point connections are considered. The proposed paper extends studying the dependence of the embedded diagnostic circulant graph on the vertex numbering of a graph into which the embedding is performed. A graph of direct product of cyclic groups is used as the graph into which the embedding is performed (a work graph). The embedding is based on partitioning the work graph into cossets with respect to the subgroup of degrees of the chosen element. Conditions under which the structural robustness of the whole embedded graph or its fragments does not depend on the numbering are found.