A Graph Model for Fault-Tolerant Computing Systems

DOI10.1109/TC.1976.1674712zbMath0333.94015OpenAlexW2038645231MaRDI QIDQ4099527

John P. Hayes

Publication date: 1976

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1976.1674712

Mathematics Subject Classification ID

Related Items (49)

Tolerating faults in a mesh with a row of spare nodes ⋮ Finding a target subnetwork in sparse networks with random faults ⋮ T-irreducible extension of polygonal digraphs ⋮ Remarks on Caristi's fixed point theorem in metric spaces with a graph ⋮ Vertex extensions of 4-layer graphs and hypercubes ⋮ A survey of the theory of hypercube graphs ⋮ THE MINIMAL VERTEX EXTENSIONS FOR COLORED COMPLETE GRAPHS ⋮ Explicit construction of linear sized tolerant networks ⋮ Minced trees, with applications to fault-tolerant VLSI processor arrays ⋮ Dynamic graph models ⋮ Fault tolerance of Möbius cubes under two forbidden fault set models ⋮ Gallai's property for graphs in lattices on the torus and the Möbius strip ⋮ Largest component and node fault tolerance for grids ⋮ Networks with small stretch number ⋮ A local-sparing design methodology for fault-tolerant multiprocessors ⋮ Construction of All Minimal Edge Extensions of the Graph with Isomorphism Rejection ⋮ Fault-tolerant metric dimension of generalized wheels and convex polytopes ⋮ On the complexity of some problems related to graph extensions ⋮ Fault tolerant supergraphs with automorphisms ⋮ Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs ⋮ Lattice graphs with non-concurrent longest cycles ⋮ Highly non-concurrent longest paths in lattices ⋮ NUMBER OF INACCESSIBLE STATES IN FINITE DYNAMIC SYSTEMS OF BINARY VECTORS ASSOCIATED WITH PALMS ORIENTATIONS ⋮ T-IRREDUCIBLE EXTENSIONS OF DIRECTED STARLIKE TREES ⋮ ON MINIMAL VERTEX 1-EXTENSIONS OF PATH ORIENTATION ⋮ Near packings of two graphs ⋮ Analysis of minimal path routing schemes in the presence of faults ⋮ Chordal rings as fault-tolerant loops ⋮ Explicit construction of linear sized tolerant networks. (Reprint) ⋮ Analysis and design of a fault-tolerant tree architecture ⋮ Embedding of the folded hypercubes into tori ⋮ Minimum \(k\)-critical bipartite graphs ⋮ Construction of All Nonisomorphic Minimal Vertex Extensions of the Graph by the Method of Canonical Representatives ⋮ (\(k,+\))-distance-hereditary graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Self-spanner graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quantifying fault recovery in multiprocessor systems ⋮ About uniqueness of the minimal 1-edge extension of hypercube Q4

This page was built for publication: A Graph Model for Fault-Tolerant Computing Systems