An Approximation Formula for a Class of Fault-Tolerant Computers

DOI10.1109/TR.1986.4335363MaRDI QIDQ3768121zbMATH OpenOpenAlexFDO

Authors Allan L. White

Publication date 1986

Published in IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tr.1986.4335363

zbMATH Keywords

probability of failure of fault- tolerant computing systemsredundancy, reconfigurable systemssystem reliability

Mathematics Subject Classification ID

Applications of renewal theory (reliability, demand theory, etc.) (60K10) Theory of software (68N99) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Reliability Bounds for Fault-Tolerant Systems with Competing Responses to Component Failures
• Reliable computation by formulas in the presence of noise
• Approximate Fault-Tree Analysis with Prescribed Accuracy
• Fault-tolerant programs and their reliability
• Reliability analysis of a class of fault-tolerant systems

Cited in

(8)

• Economic efficiency of fault tolerance
• A mathematical framework for algorithm-based fault-tolerant computing over a ring of integers
• scientific article; zbMATH DE number 4199936 (Why is no real title available?)
• Fault-tolerant programs and their reliability
• The Fault Tolerance of NP-Hard Problems
• Reliability Bounds for Fault-Tolerant Systems with Competing Responses to Component Failures
• Active fault protection in computer systems where job processing time is comparable with interarrival time
• Estimation of fault-tolerance of the parallel control computing systems: A new approach

This page was built for publication: An Approximation Formula for a Class of Fault-Tolerant Computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768121)