Designing fault-tolerant systems using automorphisms

DOI10.1016/0743-7315(91)90129-WzbMath0741.68018OpenAlexW2062592188MaRDI QIDQ1177282

John P. Hayes, Shantanu Dutt

Publication date: 26 June 1992

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-7315(91)90129-w

zbMATH Keywords

automorphismreconfigurationmulticomputer systemsstructural fault-tolerance

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (9)

Tolerating faults in a mesh with a row of spare nodes ⋮ Catastrophic faults in reconfigurable systolic linear arrays ⋮ Multiplicative circulant networks. Topological properties and communication algorithms ⋮ A local-sparing design methodology for fault-tolerant multiprocessors ⋮ Developing fault-tolerant distributed loops ⋮ Fault tolerant supergraphs with automorphisms ⋮ Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs ⋮ Cayley graphs as classifiers for data mining: the influence of asymmetries ⋮ Applying fault-tolerant solutions of circulant graphs to multidimensional meshes

This page was built for publication: Designing fault-tolerant systems using automorphisms