Node-covering, Error-correcting Codes and Multiprocessors with Very High Average Fault Tolerance
IEEE Transactions on Computers
Advances in ULTRA-Dependable Distributed Systems
Advances in ULTRA-Dependable Distributed Systems
Fault-Tolerant Meshes with Small Degree
IEEE Transactions on Computers
Power4 System Design for High Reliability
IEEE Micro
Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares
IEEE Transactions on Computers
Guest Editorial: Special Issue on Reliable Distributed Systems
IEEE Transactions on Computers
An approach to self-diagnosis of nonuniform digital systems
Automation and Remote Control
Design of the EPLD-based reconfigurable fault-tolerant systems with cell-level redundancy
Automation and Remote Control
| Hi-index | 0.00 |
The paper proposed approaches to minimized embedding of the Hamiltonian graphs in the enveloping fault-tolerant graph representing the structural model of a fault-tolerant multiprocessor computer system. Failures are regarded as faults of vertices and/or connections between the graph vertices. Mathematical studies rely on the group-theoretical analysis of the characteristics of system structure. It underlies the proposed unique approach to designing the one-fault-tolerant and k-fault-tolerant structures retaining after reconfiguration the logical structure of the original target graph and, therefore, the compiled code of system tasks. The minimum fault-tolerant solutions were obtained for one-fault-tolerant and k-fault-tolerant cycles, simple and diagonal grids, and other popular structures, including arbitrary Hamiltonian graphs for which solutions are of minimized nature. Consideration was given to the algorithms of reconfiguration after arbitrary single and multiple faults. Restoration after faults is very simple; it is based on small tables of the group of system automorphisms which enable correct restoration of the system “at the level of theorems” without either static or dynamic additional verification of the reconfiguration process.