Fault-Tolerant Computing Concepts and Examples

Authors:
D. A. Rennels
Affiliations:
Department of Computer Science, University of California
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 0
Cited 2

An Efficient Algorithm for Identifying the Most Likely Fault Set in a Probabilistically Diagnosable System

IEEE Transactions on Computers - The MIT Press scientific computation series
Time redundant fault-location in bit-sliced ALU's

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

This paper presents a brief history of fault-tolerant computing. This is followed by a survey of architectural approaches to fault-tolerant design, emphasizing the basic concepts employed in the design of these systems, and the tradeoffs and alternatives available to the system designer in attempting to meet applications requirements. Classes of fault-tolerance applications are identified, along with design approaches which are applicable, and several problem areas are identified in which new research results are badly needed.