A Graph Model for Fault-Tolerant Computing Systems

IEEE Transactions on Computers

Volumn C-25, Issue 9, 1976, Pages 875-884

  Hayes, John P ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Computer architecture; fault tolerant computing; fault tolerant design; graph theory; Hamiltonian graphs; singleloop systems; tree systems

Indexed keywords

COMPUTER ARCHITECTURE;

COMPUTER SYSTEMS, DIGITAL;

EID: 0016992757     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1976.1674712     Document Type: Article

References (18)

1. A. Avizienis, “Fault tolerant computing—An overview,” IEEE Computer, vol. 45–8, Jan./Feb. 1971.
2. J. P. Hayes, “Modeling faults in digital logic circuits,” in 1974 Symp. Rational Fault Analysis (Lubbock, TX, Aug.1974), to be published.
3. W. H. Pierce, Failure-Tolerant Computer Design. New York: Academic, 1965.
4. R. A. Short, “The attainment of reliable digital systems through the use of redundancy—A survey,” IEEE Computer Group News2–17, Mar. 1968.
5. W. G. Bouricius et al., “Reliability modeling for fault tolerant computers,” IEEE Trans. Comput C-201306–1311, Nov. 1971.
6. F. Harary, Graph Theory. Reading, MA: Addison-Wesley, 1969.
7. C. Berge, Graphes et Hypergraphes. Paris, France: Dunod, 1970.
8. B. Langefors, Theoretical Analysis of Information Systems, 4th ed. Philadelphia, PA: Auerbach, 1973.
9. C. V. Ramamoorthy, “A structural theory of machine diagnosis,” in 1967 Spring Joint Computer Conf. Proc. Montvale, NJ743–756.
10. F. P. Preparata, G. Metze, and R. Chien, “On the connection assignment problem of diagnosable systems,” IEEE Trans. Electronic Comput EC-14848–854, Dec. 1967.
11. C. G. Bell and A. Newell, Computer Structures: Readings and Examples. New York: McGraw-Hill, 1971.
12. A. T. Berztiss, “A backtrack procedure for isomorphism of directed graphs,” J.ACM, vol. 20365–377, 1973.
13. K. J. Thurber et al., “A systematic approach to the design of digital bussing structures,” in 1972 Fall Joint Computer Conf.Proc. Montvale, NJ719-740.
14. G. Chartrand, S. F. Kapoor, and D. R. Lick, “n-Hamiltonian graphs,” J. Combinatorial Theory, vol. 9308–312, 1970.
15. D. Knuth, The Art of Computer Programming: Fundamental Algorithms, vol. 1, 2nd ed. Reading, MA: Addison-Wesley, 1973.
16. R. E. Miller, “A comparison of some theoretical models of parallel computation,” IEEE Trans. Comput C-22710–717, Aug. 1973.
17. R. S. Wilkov, “Analysis and design of reliable computer networks,” IEEE Trans. Communications, vol. COM-20660–678, June 1968.
18. A. H. Hopkins and T. B. Smith, “The architectural elements of a symmetric fault-tolerant multiprocessor,” IEEE Trans. Comput C-24498–505, May 1975.