A Graph Model for Fault-Tolerant Computing Systems

An approach to fault-tolerant design is described in which a computing system S and an algorithm A to be executed by S are both defined by graphs whose nodes represent computing facilities. A is executable by S if A is isomorphic to a subgraph of S.A k-fault is the removal of k nodes (facilities) from S.S is a k-fault tolerant (k-FT) realization of A if A can be executed by S with any k-fault present in S. The problem of designing optimal k-FT systems is considered where A is equated to a 0-FT system. Techniques are described for designing optimal k-FT realizations of single-loop systems; these techniques are related to results in Hamiltonian graph theory. The design of optimal k-FT realizations of certain types of tree systems is also examined. The advantages and disadvantages of the graph model are discussed.

[1]  Peter Weiner,et al.  Optimization of Reduced Dependencies for Synchronous Sequential Machines , 1967, IEEE Trans. Electron. Comput..

[2]  C. Berge.  Graphes et hypergraphes , 1970 .

[3]  William C. Carter,et al.  Reliability Modeling for Fault-Tolerant Computers , 1971, IEEE Transactions on Computers.

[4]  Börje Langefors,et al.  Theoretical analysis of information systems , 1973 .

[5]  Algirdas Avizienis.  Faulty-Tolerant Computing: An Overview , 1971, Computer.

[6]  D. R. Lick,et al.  n-Hamiltonian graphs , 1970 .

[7]  Allen Newell,et al.  Computer Structures: Readings and Examples, , 1971 .

[8]  Raymond E. Miller,et al.  A Comparison of Some Theoretical Models of Parallel Computation , 1973, IEEE Transactions on Computers.

[9]  GERNOT METZE,et al.  On the Connection Assignment Problem of Diagnosable Systems , 1967, IEEE Trans. Electron. Comput..

[10]  T. Basil Smith,et al.  The Architectural Elements of a Symmetric Fault-Tolerant Multiprocessor , 1975, IEEE Transactions on Computers.

[11]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[12]  Raymond E. Miller.  A Comparison ofSomeTheoretical Models ofParallel Computation , 1973 .

[13]  Frank Harary,et al.  Graph Theory , 2016 .

[14]  R. Wilkov,et al.  Analysis and Design of Reliable Computer Networks , 1972, IEEE Trans. Commun..

[15]  C. V. Ramamoorthy,et al.  A structural theory of machine diagnosis , 1899, AFIPS '67 (Spring).

[16]  Alfs T. Berztiss,et al.  A Backtrack Procedure for Isomorphism of Directed Graphs , 1973, JACM.

[17]  Kenneth J. Thurber,et al.  A systematic approach to the design of digital bussing structures , 1972, AFIPS '72 (Fall, part II).