On the complexity of testing for catastrophic faults

DOI10.1007/BFB0015423MaRDI QIDQ6487962zbMATH OpenFDO

Authors N. Santoro, J. Ren, A. Nayak

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/BFB0015423

Mathematics Subject Classification ID

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

Recommendations

• On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy
• Characterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links
• scientific article; zbMATH DE number 434680
• Efficient construction of catastrophic patterns for VLSI reconfigurable arrays
• scientific article; zbMATH DE number 1735657

Cites work

• Counting the number of fault patterns in redundant VLSI arrays
• Efficient construction of catastrophic patterns for VLSI reconfigurable arrays
• Efficient Parallel Algorithms for String Editing and Related Problems
• scientific article; zbMATH DE number 434680 (Why is no real title available?)
• On reconfigurability of VLSI linear arrays
• Restructuring for fault-tolerant systolic arrays

Cited in

(6)

• Dynamic monopolies in tori.
• Local majorities, coalitions and monopolies in graphs: A review
• scientific article; zbMATH DE number 434680 (Why is no real title available?)
• Models of the general theory of test construction of relatively constant malfunctions
• On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy
• Optimal irreversible dynamos in chordal rings

This page was built for publication: On the complexity of testing for catastrophic faults

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