Designing fault-tolerant systems using automorphisms (Q1177282)

The paper deals with structural fault-tolerance of multiprocessor systems, defined as the ability of a system to reconfigure around fault so that the reconfigured system is isomorphic or automorphic to the original one. A multiprocessor system is described by a graph whose nodes correspond to processors and edges represent interprocessor links. It is assumed that a link failure corresponds to the deletion of an edge from the graph. Similarly, a processor failure corresponds to removal from a graph a node together with all edges incident with it. The authors describe properties of graphs and supergraphs ensuring a given degree of fault-tolerance and requiring low redundancy, measured by the number of spare nodes and links. Moreover, they propose the construction of supergraphs with given properties of automorphism and develop a cost-effective iterative reconfiguration scheme for circulant and noncirculant graphs. Finally, the authors give suitable reconfiguration algorithms.