A new error analysis based method for tolerance computation for algorithm-based checks

DOI10.1109/12.485376MaRDI QIDQ4420901zbMATH OpenOpenAlexFDO

Authors Amber Roy-Chowdhury, Prithviraj Banerjee

Publication date 1996

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

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

zbMATH Keywords

algorithm-based fault-tolerancecheck thresholdingchecksum encodingsroundoff error analysis

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Parallel algorithms in computer science (68W10)

Recommendations

• Construction of check sets for algorithm-based fault tolerance
• Algorithmic Fault Tolerance Using the Lanczos Method
• Mantissa-preserving operations and robust algorithm based fault tolerance for matrix computations
• Algorithm-based error-detection schemes for iterative solution of partial differential equations
• Efficient techniques for the analysis of algorithm-based fault tolerance (ABFT) schemes

Cited in

(1)

• Construction of check sets for algorithm-based fault tolerance

This page was built for publication: A new error analysis based method for tolerance computation for algorithm-based checks

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