Construction of check sets for algorithm-based fault tolerance

DOI10.1109/12.286298MaRDI QIDQ4420042zbMATH OpenOpenAlexFDO

Authors Dechang Gu, S. S. Ravi, Daniel J. Rosenkrantz

Publication date 1994

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

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

zbMATH Keywords

dependence graphon-line check

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Algorithm-based fault location and recovery for matrix computations on multiprocessor systems
• Efficient techniques for the analysis of algorithm-based fault tolerance (ABFT) schemes
• Algorithm-based fault tolerance for FFT networks
• Determining performance measures of algorithm-based fault tolerant systems
• A new error analysis based method for tolerance computation for algorithm-based checks

Cited in

(7)

• Determining performance measures of algorithm-based fault tolerant systems
• Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets
• Algorithm-based fault tolerance for FFT networks
• Algorithm-based fault location and recovery for matrix computations on multiprocessor systems
• A new error analysis based method for tolerance computation for algorithm-based checks
• Efficient techniques for the analysis of algorithm-based fault tolerance (ABFT) schemes
• An efficient algorithm-based concurrent error detection for FFT networks

This page was built for publication: Construction of check sets for algorithm-based fault tolerance

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